./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/realpath-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/realpath-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4b52b87ac615113f99c41c6355599f8806a623b886ffd195b03cb3f162f5306d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:57:30,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:57:30,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:57:30,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:57:30,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:57:30,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:57:30,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:57:30,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:57:30,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:57:30,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:57:30,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:57:30,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:57:30,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:57:30,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:57:30,521 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:57:30,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:57:30,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:57:30,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:57:30,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:57:30,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:57:30,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:57:30,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:57:30,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:57:30,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:57:30,524 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b52b87ac615113f99c41c6355599f8806a623b886ffd195b03cb3f162f5306d [2025-03-17 18:57:30,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:57:30,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:57:30,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:57:30,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:57:30,765 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:57:30,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/realpath-2.i [2025-03-17 18:57:31,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73e2a9d4/e936e59569ae4af68de82d9acbb2fd90/FLAG9e6a72175 [2025-03-17 18:57:32,275 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:57:32,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/realpath-2.i [2025-03-17 18:57:32,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73e2a9d4/e936e59569ae4af68de82d9acbb2fd90/FLAG9e6a72175 [2025-03-17 18:57:32,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73e2a9d4/e936e59569ae4af68de82d9acbb2fd90 [2025-03-17 18:57:32,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:57:32,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:57:32,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:57:32,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:57:32,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:57:32,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:57:32" (1/1) ... [2025-03-17 18:57:32,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce4d9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:32, skipping insertion in model container [2025-03-17 18:57:32,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:57:32" (1/1) ... [2025-03-17 18:57:32,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:57:32,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:57:32,990 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:57:33,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:57:33,243 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 18:57:33,248 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:57:33,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33 WrapperNode [2025-03-17 18:57:33,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:57:33,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:57:33,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:57:33,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:57:33,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,355 INFO L138 Inliner]: procedures = 600, calls = 515, calls flagged for inlining = 18, calls inlined = 15, statements flattened = 838 [2025-03-17 18:57:33,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:57:33,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:57:33,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:57:33,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:57:33,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,377 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 18:57:33,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:57:33,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:57:33,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:57:33,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:57:33,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (1/1) ... [2025-03-17 18:57:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:57:33,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:33,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 18:57:33,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 18:57:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 18:57:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 18:57:33,451 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:57:33,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 18:57:33,451 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 18:57:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 18:57:33,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 18:57:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 18:57:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 18:57:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 18:57:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 18:57:33,713 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:57:33,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:57:35,304 INFO L? ?]: Removed 221 outVars from TransFormulas that were not future-live. [2025-03-17 18:57:35,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:57:35,322 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:57:35,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:57:35,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:57:35 BoogieIcfgContainer [2025-03-17 18:57:35,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:57:35,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:57:35,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:57:35,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:57:35,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:57:32" (1/3) ... [2025-03-17 18:57:35,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a469970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:57:35, skipping insertion in model container [2025-03-17 18:57:35,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:33" (2/3) ... [2025-03-17 18:57:35,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a469970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:57:35, skipping insertion in model container [2025-03-17 18:57:35,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:57:35" (3/3) ... [2025-03-17 18:57:35,331 INFO L128 eAbstractionObserver]: Analyzing ICFG realpath-2.i [2025-03-17 18:57:35,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:57:35,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG realpath-2.i that has 4 procedures, 156 locations, 1 initial locations, 13 loop locations, and 41 error locations. [2025-03-17 18:57:35,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:57:35,403 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a358bfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:57:35,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-03-17 18:57:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 104 states have (on average 1.7596153846153846) internal successors, (183), 145 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 18:57:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 18:57:35,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:35,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 18:57:35,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:35,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash 233323, now seen corresponding path program 1 times [2025-03-17 18:57:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:35,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842673447] [2025-03-17 18:57:35,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:35,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 18:57:35,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 18:57:35,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:35,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:57:36,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842673447] [2025-03-17 18:57:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842673447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:36,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:36,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 18:57:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930873059] [2025-03-17 18:57:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:36,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:36,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:36,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:36,130 INFO L87 Difference]: Start difference. First operand has 156 states, 104 states have (on average 1.7596153846153846) internal successors, (183), 145 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:57:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:36,168 INFO L93 Difference]: Finished difference Result 217 states and 278 transitions. [2025-03-17 18:57:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:36,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 18:57:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:36,176 INFO L225 Difference]: With dead ends: 217 [2025-03-17 18:57:36,176 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 18:57:36,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:36,181 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:36,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:57:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 18:57:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 18:57:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 57 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-03-17 18:57:36,207 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 3 [2025-03-17 18:57:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:36,207 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-03-17 18:57:36,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:57:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-03-17 18:57:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 18:57:36,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:36,208 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 18:57:36,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:57:36,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:36,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1638840163, now seen corresponding path program 1 times [2025-03-17 18:57:36,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:36,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738425526] [2025-03-17 18:57:36,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:36,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:36,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:57:36,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:57:36,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:36,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:57:36,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738425526] [2025-03-17 18:57:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738425526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:36,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708419834] [2025-03-17 18:57:36,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:36,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:36,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:36,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:36,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 18:57:36,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:57:36,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:57:36,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:36,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:36,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:36,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:57:36,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708419834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 18:57:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080960381] [2025-03-17 18:57:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:57:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:36,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:57:36,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:36,964 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:57:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:37,704 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-03-17 18:57:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:57:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 18:57:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:37,705 INFO L225 Difference]: With dead ends: 63 [2025-03-17 18:57:37,705 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 18:57:37,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:37,706 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:37,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 18:57:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 18:57:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-03-17 18:57:37,716 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 6 [2025-03-17 18:57:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:37,716 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-03-17 18:57:37,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:57:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-03-17 18:57:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 18:57:37,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:37,717 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 18:57:37,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 18:57:37,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:37,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:37,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:37,918 INFO L85 PathProgramCache]: Analyzing trace with hash 735562669, now seen corresponding path program 1 times [2025-03-17 18:57:37,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:37,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793809161] [2025-03-17 18:57:37,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:37,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:38,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 18:57:38,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 18:57:38,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:38,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:57:38,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:38,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793809161] [2025-03-17 18:57:38,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793809161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:38,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:38,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107086594] [2025-03-17 18:57:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:38,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:38,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:38,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:38,151 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:57:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:38,176 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-03-17 18:57:38,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:38,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 18:57:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:38,177 INFO L225 Difference]: With dead ends: 62 [2025-03-17 18:57:38,177 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 18:57:38,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:38,178 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:38,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:57:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 18:57:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-03-17 18:57:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 53 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-17 18:57:38,182 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 7 [2025-03-17 18:57:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:38,182 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-17 18:57:38,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:57:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-03-17 18:57:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 18:57:38,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:38,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:38,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:57:38,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:38,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1475363525, now seen corresponding path program 1 times [2025-03-17 18:57:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:38,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785948780] [2025-03-17 18:57:38,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:38,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:57:38,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:57:38,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:38,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:57:38,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785948780] [2025-03-17 18:57:38,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785948780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:38,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741981172] [2025-03-17 18:57:38,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:38,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:38,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:38,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:38,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 18:57:38,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:57:38,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:57:38,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:38,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:38,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:57:38,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:57:38,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741981172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:38,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:38,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:57:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096195278] [2025-03-17 18:57:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:38,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:38,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:38,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:38,893 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:40,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:57:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:40,224 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-03-17 18:57:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 18:57:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:40,225 INFO L225 Difference]: With dead ends: 59 [2025-03-17 18:57:40,225 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 18:57:40,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:40,226 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:40,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 75 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 18:57:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 18:57:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 18:57:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 51 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-03-17 18:57:40,230 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 11 [2025-03-17 18:57:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:40,231 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-03-17 18:57:40,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-03-17 18:57:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 18:57:40,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:40,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:40,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 18:57:40,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 18:57:40,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:40,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1508371145, now seen corresponding path program 1 times [2025-03-17 18:57:40,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:40,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178939368] [2025-03-17 18:57:40,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:40,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:57:40,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:57:40,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:57:40,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:40,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178939368] [2025-03-17 18:57:40,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178939368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:40,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913582476] [2025-03-17 18:57:40,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:40,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:40,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:40,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:40,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 18:57:40,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:57:41,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:57:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:41,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:41,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:57:41,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:57:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913582476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:57:41,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:57:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 18:57:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138406601] [2025-03-17 18:57:41,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:41,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:57:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:57:41,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:41,146 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:57:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:41,178 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2025-03-17 18:57:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:57:41,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-03-17 18:57:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:41,180 INFO L225 Difference]: With dead ends: 118 [2025-03-17 18:57:41,180 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 18:57:41,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:41,181 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:41,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 188 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:57:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 18:57:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 18:57:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.392156862745098) internal successors, (71), 60 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2025-03-17 18:57:41,186 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 12 [2025-03-17 18:57:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:41,186 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2025-03-17 18:57:41,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:57:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2025-03-17 18:57:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 18:57:41,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:41,187 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:41,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 18:57:41,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:41,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:41,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash -112171881, now seen corresponding path program 2 times [2025-03-17 18:57:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:41,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485022568] [2025-03-17 18:57:41,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:57:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:41,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 18:57:41,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-03-17 18:57:41,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:57:41,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:57:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485022568] [2025-03-17 18:57:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485022568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:41,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:41,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:57:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455592352] [2025-03-17 18:57:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:41,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:57:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:41,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:57:41,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:41,763 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:43,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:57:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:43,289 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-17 18:57:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:57:43,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 18:57:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:43,290 INFO L225 Difference]: With dead ends: 66 [2025-03-17 18:57:43,290 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 18:57:43,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:43,291 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:43,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 174 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 18:57:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 18:57:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 18:57:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-03-17 18:57:43,295 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 21 [2025-03-17 18:57:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-03-17 18:57:43,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-03-17 18:57:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 18:57:43,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:43,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:57:43,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 137356488, now seen corresponding path program 1 times [2025-03-17 18:57:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265840112] [2025-03-17 18:57:43,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:43,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 18:57:43,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 18:57:43,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:43,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:57:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265840112] [2025-03-17 18:57:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265840112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:43,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:43,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:57:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369830551] [2025-03-17 18:57:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:43,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:43,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:43,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:43,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:43,540 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:44,433 INFO L93 Difference]: Finished difference Result 112 states and 135 transitions. [2025-03-17 18:57:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:44,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-17 18:57:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:44,434 INFO L225 Difference]: With dead ends: 112 [2025-03-17 18:57:44,434 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 18:57:44,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:44,435 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:44,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 18:57:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 18:57:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 18:57:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2025-03-17 18:57:44,441 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 26 [2025-03-17 18:57:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:44,441 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2025-03-17 18:57:44,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2025-03-17 18:57:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 18:57:44,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:44,445 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:44,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:57:44,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:44,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1154799426, now seen corresponding path program 1 times [2025-03-17 18:57:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:44,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199883667] [2025-03-17 18:57:44,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:44,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 18:57:44,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 18:57:44,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:57:44,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:44,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199883667] [2025-03-17 18:57:44,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199883667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:44,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:44,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88231280] [2025-03-17 18:57:44,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:44,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:44,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:44,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:44,675 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:45,488 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-03-17 18:57:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:45,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-17 18:57:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:45,489 INFO L225 Difference]: With dead ends: 72 [2025-03-17 18:57:45,489 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 18:57:45,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:45,490 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:45,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 18:57:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 18:57:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-17 18:57:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 64 states have internal predecessors, (75), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2025-03-17 18:57:45,495 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2025-03-17 18:57:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:45,495 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2025-03-17 18:57:45,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2025-03-17 18:57:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:57:45,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:45,496 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:45,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 18:57:45,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1111779632, now seen corresponding path program 1 times [2025-03-17 18:57:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:45,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067376283] [2025-03-17 18:57:45,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:45,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:45,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:45,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:45,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:57:45,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:45,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067376283] [2025-03-17 18:57:45,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067376283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:45,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108433332] [2025-03-17 18:57:45,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:45,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:45,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:45,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:45,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 18:57:46,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:46,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:46,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:46,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:46,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:57:46,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 18:57:46,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:46,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108433332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:46,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:46,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:57:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837078987] [2025-03-17 18:57:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:46,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:46,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:46,152 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:47,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:57:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:47,247 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-17 18:57:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-17 18:57:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:47,248 INFO L225 Difference]: With dead ends: 70 [2025-03-17 18:57:47,248 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 18:57:47,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:47,249 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:47,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 109 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 18:57:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 18:57:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 18:57:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 63 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2025-03-17 18:57:47,255 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 29 [2025-03-17 18:57:47,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:47,255 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2025-03-17 18:57:47,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2025-03-17 18:57:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:57:47,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:47,255 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:47,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 18:57:47,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:47,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:47,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1111779472, now seen corresponding path program 1 times [2025-03-17 18:57:47,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:47,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535184019] [2025-03-17 18:57:47,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:47,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:47,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:47,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:47,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:47,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:57:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:47,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535184019] [2025-03-17 18:57:47,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535184019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:47,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228773624] [2025-03-17 18:57:47,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:47,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:47,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:47,701 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:47,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 18:57:47,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:48,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:48,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:57:48,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 18:57:48,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 18:57:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228773624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:57:48,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:57:48,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-03-17 18:57:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820184174] [2025-03-17 18:57:48,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 18:57:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:48,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 18:57:48,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:57:48,243 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:57:49,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:57:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:50,334 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2025-03-17 18:57:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 18:57:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-17 18:57:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:50,335 INFO L225 Difference]: With dead ends: 141 [2025-03-17 18:57:50,335 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 18:57:50,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:57:50,336 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:50,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 267 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 18:57:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 18:57:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 18:57:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 80 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-03-17 18:57:50,340 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 29 [2025-03-17 18:57:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:50,340 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-03-17 18:57:50,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 18:57:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-03-17 18:57:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 18:57:50,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:50,341 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:50,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 18:57:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 18:57:50,542 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:50,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash 716569477, now seen corresponding path program 1 times [2025-03-17 18:57:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194993722] [2025-03-17 18:57:50,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:50,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 18:57:50,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 18:57:50,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:50,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 18:57:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:50,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194993722] [2025-03-17 18:57:50,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194993722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:50,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723947095] [2025-03-17 18:57:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:50,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:50,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:50,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:50,813 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:51,500 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2025-03-17 18:57:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:51,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 18:57:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:51,502 INFO L225 Difference]: With dead ends: 97 [2025-03-17 18:57:51,502 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 18:57:51,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:51,503 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:51,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 18:57:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 18:57:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 89 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2025-03-17 18:57:51,509 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 48 [2025-03-17 18:57:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:51,509 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2025-03-17 18:57:51,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2025-03-17 18:57:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 18:57:51,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:51,510 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:51,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 18:57:51,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:51,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash 716574442, now seen corresponding path program 1 times [2025-03-17 18:57:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:51,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938728853] [2025-03-17 18:57:51,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:51,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 18:57:51,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 18:57:51,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:51,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 18:57:51,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938728853] [2025-03-17 18:57:51,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938728853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:51,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:51,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504243502] [2025-03-17 18:57:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:51,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:51,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:51,752 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:52,492 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-03-17 18:57:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 18:57:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:52,494 INFO L225 Difference]: With dead ends: 95 [2025-03-17 18:57:52,494 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 18:57:52,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:52,495 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:52,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 18:57:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2025-03-17 18:57:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.2125) internal successors, (97), 84 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2025-03-17 18:57:52,505 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 48 [2025-03-17 18:57:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:52,505 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2025-03-17 18:57:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2025-03-17 18:57:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 18:57:52,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:52,506 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:52,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 18:57:52,509 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:52,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash -229367314, now seen corresponding path program 1 times [2025-03-17 18:57:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464241325] [2025-03-17 18:57:52,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:52,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 18:57:52,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 18:57:52,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:52,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 18:57:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464241325] [2025-03-17 18:57:52,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464241325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:52,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370226799] [2025-03-17 18:57:52,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:52,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:52,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:52,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:52,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 18:57:53,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 18:57:53,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 18:57:53,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:53,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:53,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 18:57:53,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 18:57:53,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370226799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:53,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:53,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-17 18:57:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242404800] [2025-03-17 18:57:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:57:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:53,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:57:53,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:53,200 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:55,784 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2025-03-17 18:57:55,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:57:55,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 18:57:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:55,785 INFO L225 Difference]: With dead ends: 116 [2025-03-17 18:57:55,785 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 18:57:55,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:55,785 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 26 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:55,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 216 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 18:57:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 18:57:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2025-03-17 18:57:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 85 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2025-03-17 18:57:55,795 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 49 [2025-03-17 18:57:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:55,795 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2025-03-17 18:57:55,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2025-03-17 18:57:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 18:57:55,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:55,796 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:55,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 18:57:55,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:55,997 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:55,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1229086097, now seen corresponding path program 1 times [2025-03-17 18:57:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063677961] [2025-03-17 18:57:55,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:56,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 18:57:56,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 18:57:56,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:56,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 18:57:56,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063677961] [2025-03-17 18:57:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063677961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:56,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:57:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638464322] [2025-03-17 18:57:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:56,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:57:56,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:56,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:57:56,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:57:56,299 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:56,316 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2025-03-17 18:57:56,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:57:56,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-17 18:57:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:56,317 INFO L225 Difference]: With dead ends: 121 [2025-03-17 18:57:56,317 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 18:57:56,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 18:57:56,317 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:56,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:57:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 18:57:56,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 18:57:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 87 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2025-03-17 18:57:56,322 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 50 [2025-03-17 18:57:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:56,323 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2025-03-17 18:57:56,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2025-03-17 18:57:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 18:57:56,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:56,323 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:56,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 18:57:56,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:56,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1413543903, now seen corresponding path program 1 times [2025-03-17 18:57:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099761390] [2025-03-17 18:57:56,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:56,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 18:57:56,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 18:57:56,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:56,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 18:57:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099761390] [2025-03-17 18:57:56,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099761390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:56,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:56,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 18:57:56,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460666383] [2025-03-17 18:57:56,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:56,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:57:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:56,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:57:56,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:56,577 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:56,595 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2025-03-17 18:57:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:57:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-17 18:57:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:56,596 INFO L225 Difference]: With dead ends: 96 [2025-03-17 18:57:56,596 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 18:57:56,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:57:56,597 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 16 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:56,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 212 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 18:57:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 18:57:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 18:57:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-03-17 18:57:56,600 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 54 [2025-03-17 18:57:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:56,601 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-03-17 18:57:56,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-03-17 18:57:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 18:57:56,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:56,602 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:56,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 18:57:56,602 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:56,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1413544864, now seen corresponding path program 1 times [2025-03-17 18:57:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137828195] [2025-03-17 18:57:56,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:56,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 18:57:56,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 18:57:56,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:56,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 18:57:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137828195] [2025-03-17 18:57:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137828195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:57,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:57,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 18:57:57,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222043251] [2025-03-17 18:57:57,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:57,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:57:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:57,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:57:57,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:57:57,151 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:57,890 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2025-03-17 18:57:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:57:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-17 18:57:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:57,890 INFO L225 Difference]: With dead ends: 123 [2025-03-17 18:57:57,890 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 18:57:57,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:57:57,891 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 49 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:57,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 181 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 18:57:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 18:57:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 86 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:57:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2025-03-17 18:57:57,895 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 54 [2025-03-17 18:57:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:57,895 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2025-03-17 18:57:57,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:57:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2025-03-17 18:57:57,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 18:57:57,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:57,896 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:57,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 18:57:57,896 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:57:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2169173, now seen corresponding path program 1 times [2025-03-17 18:57:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319378245] [2025-03-17 18:57:57,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:58,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:57:58,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:57:58,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:58,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:57:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319378245] [2025-03-17 18:57:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319378245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:58,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562425747] [2025-03-17 18:57:58,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:58,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:58,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:58,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 18:57:58,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:57:58,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:57:58,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:58,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:58,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:58,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:57:58,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:57:58,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562425747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:57:58,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:57:58,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 18:57:58,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171413895] [2025-03-17 18:57:58,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:58,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:57:58,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:58,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:57:58,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:58,689 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:58:00,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:58:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:00,738 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2025-03-17 18:58:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:58:00,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-17 18:58:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:00,741 INFO L225 Difference]: With dead ends: 160 [2025-03-17 18:58:00,741 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 18:58:00,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:58:00,741 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:00,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 18:58:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 18:58:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 18:58:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 100 states have (on average 1.15) internal successors, (115), 104 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:58:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2025-03-17 18:58:00,747 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 55 [2025-03-17 18:58:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:00,747 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2025-03-17 18:58:00,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:58:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2025-03-17 18:58:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 18:58:00,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:00,748 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:00,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 18:58:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:00,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:58:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1894143578, now seen corresponding path program 1 times [2025-03-17 18:58:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052737792] [2025-03-17 18:58:00,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:01,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 18:58:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 18:58:01,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:01,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-17 18:58:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052737792] [2025-03-17 18:58:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052737792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135806435] [2025-03-17 18:58:01,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:01,204 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:58:01,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 18:58:01,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 18:58:01,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 18:58:01,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:01,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:01,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:58:01,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 18:58:01,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:58:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 18:58:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135806435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:58:01,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:58:01,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-17 18:58:01,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822294757] [2025-03-17 18:58:01,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:58:01,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 18:58:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:01,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 18:58:01,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:58:01,850 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:58:06,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:58:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:06,252 INFO L93 Difference]: Finished difference Result 204 states and 236 transitions. [2025-03-17 18:58:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 18:58:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2025-03-17 18:58:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:06,253 INFO L225 Difference]: With dead ends: 204 [2025-03-17 18:58:06,253 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 18:58:06,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:58:06,254 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:06,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 305 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 18:58:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 18:58:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-17 18:58:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 136 states have (on average 1.1029411764705883) internal successors, (150), 139 states have internal predecessors, (150), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:58:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2025-03-17 18:58:06,260 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 65 [2025-03-17 18:58:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2025-03-17 18:58:06,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:58:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2025-03-17 18:58:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 18:58:06,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:06,261 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:06,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 18:58:06,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 18:58:06,462 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:58:06,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1057700728, now seen corresponding path program 1 times [2025-03-17 18:58:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091165057] [2025-03-17 18:58:06,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:06,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 18:58:06,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 18:58:06,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:06,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091165057] [2025-03-17 18:58:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091165057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339411843] [2025-03-17 18:58:06,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:06,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:06,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:06,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:58:06,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 18:58:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 18:58:07,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 18:58:07,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:07,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:07,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1644 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:58:07,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:07,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:58:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339411843] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:58:07,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:58:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 18:58:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141424054] [2025-03-17 18:58:07,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:58:07,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:58:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:07,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:58:07,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:58:07,312 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:58:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:10,009 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2025-03-17 18:58:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:58:10,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2025-03-17 18:58:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:10,010 INFO L225 Difference]: With dead ends: 155 [2025-03-17 18:58:10,010 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 18:58:10,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:58:10,011 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:10,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 18:58:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 18:58:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-17 18:58:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 145 states have (on average 1.096551724137931) internal successors, (159), 148 states have internal predecessors, (159), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 18:58:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 165 transitions. [2025-03-17 18:58:10,018 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 165 transitions. Word has length 84 [2025-03-17 18:58:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 165 transitions. [2025-03-17 18:58:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:58:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 165 transitions. [2025-03-17 18:58:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 18:58:10,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:10,020 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:10,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 18:58:10,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:10,220 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 38 more)] === [2025-03-17 18:58:10,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash -26722328, now seen corresponding path program 1 times [2025-03-17 18:58:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:10,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484156106] [2025-03-17 18:58:10,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:10,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 18:58:10,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 18:58:10,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:10,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-17 18:58:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484156106] [2025-03-17 18:58:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484156106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748077794] [2025-03-17 18:58:14,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:14,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:14,619 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:58:14,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 18:58:15,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 18:58:15,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 18:58:15,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:15,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1781 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-17 18:58:15,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:15,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 18:58:15,255 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 18:58:15,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 18:58:15,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 18:58:15,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 18:58:15,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:15,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 110 [2025-03-17 18:58:15,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:15,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:15,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 116 [2025-03-17 18:58:15,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:15,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2025-03-17 18:58:15,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:15,390 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2025-03-17 18:58:15,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 59 [2025-03-17 18:58:15,399 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 18:58:15,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 18:58:15,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-17 18:58:15,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:15,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 84 [2025-03-17 18:58:15,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:15,435 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-03-17 18:58:15,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2025-03-17 18:58:15,476 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,532 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,587 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,650 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,707 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,760 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,817 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,866 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,913 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:15,961 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 18:58:15,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2025-03-17 18:58:15,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2025-03-17 18:58:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-17 18:58:16,056 INFO L312 TraceCheckSpWp]: Computing backward predicates...