./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c -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 06d48bd39a18f705c3286a70a8cdcced2226e3b2a16c7a38c85f5398d4bcad34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:00,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:00,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:00,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:00,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:00,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:00,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:00,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:00,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:00,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:00,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:00,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:00,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:00,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:00,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:00,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:00,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:00,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:00,382 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 -> 06d48bd39a18f705c3286a70a8cdcced2226e3b2a16c7a38c85f5398d4bcad34 [2025-03-04 10:32:00,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:00,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:00,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:00,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:00,594 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:00,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2025-03-04 10:32:01,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961b90216/e688f5c68f344718802313a838600c56/FLAG91e46a1c4 [2025-03-04 10:32:01,935 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:01,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2025-03-04 10:32:01,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961b90216/e688f5c68f344718802313a838600c56/FLAG91e46a1c4 [2025-03-04 10:32:02,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961b90216/e688f5c68f344718802313a838600c56 [2025-03-04 10:32:02,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:02,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:02,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:02,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:02,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:02,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f713cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02, skipping insertion in model container [2025-03-04 10:32:02,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:02,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:02,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:02,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:02,436 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:02,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02 WrapperNode [2025-03-04 10:32:02,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:02,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:02,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:02,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:02,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,453 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-03-04 10:32:02,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:02,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:02,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:02,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:02,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,461 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:32:02,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,462 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:02,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:02,464 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:02,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:02,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (1/1) ... [2025-03-04 10:32:02,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:02,486 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-04 10:32:02,488 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-04 10:32:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:02,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:02,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:02,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:02,611 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:02,611 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:02,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:02,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:02,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:02 BoogieIcfgContainer [2025-03-04 10:32:02,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:02,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:02,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:02,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:02,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:02" (1/3) ... [2025-03-04 10:32:02,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e206881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:02, skipping insertion in model container [2025-03-04 10:32:02,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:02" (2/3) ... [2025-03-04 10:32:02,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e206881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:02, skipping insertion in model container [2025-03-04 10:32:02,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:02" (3/3) ... [2025-03-04 10:32:02,629 INFO L128 eAbstractionObserver]: Analyzing ICFG GopanReps-CAV2006-Fig1a.c [2025-03-04 10:32:02,640 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:02,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG GopanReps-CAV2006-Fig1a.c that has 1 procedures, 19 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-04 10:32:02,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:02,696 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;@33120b3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:02,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:32:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 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-04 10:32:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:32:02,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:02,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:32:02,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:02,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:02,709 INFO L85 PathProgramCache]: Analyzing trace with hash 46729135, now seen corresponding path program 1 times [2025-03-04 10:32:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105752875] [2025-03-04 10:32:02,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:02,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:02,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:32:02,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:32:02,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:02,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:02,808 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-04 10:32:02,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105752875] [2025-03-04 10:32:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105752875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:02,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:02,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:02,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189729250] [2025-03-04 10:32:02,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:02,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:02,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:02,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:02,830 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-04 10:32:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:02,856 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-04 10:32:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 10:32:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:02,861 INFO L225 Difference]: With dead ends: 45 [2025-03-04 10:32:02,861 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:32:02,863 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-04 10:32:02,864 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:02,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:32:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-04 10:32:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 21 states have internal predecessors, (26), 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-04 10:32:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-04 10:32:02,887 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2025-03-04 10:32:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:02,887 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-04 10:32:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-04 10:32:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-04 10:32:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:32:02,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:02,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:32:02,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:02,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:02,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash 46729100, now seen corresponding path program 1 times [2025-03-04 10:32:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83452241] [2025-03-04 10:32:02,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:02,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:32:02,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:32:02,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:02,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:02,916 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-04 10:32:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83452241] [2025-03-04 10:32:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83452241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:02,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:02,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850408920] [2025-03-04 10:32:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:02,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:02,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:02,918 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 10:32:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:02,938 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-04 10:32:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:02,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 10:32:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:02,939 INFO L225 Difference]: With dead ends: 27 [2025-03-04 10:32:02,939 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 10:32:02,939 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-04 10:32:02,940 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:02,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:02,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 10:32:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2025-03-04 10:32:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 19 states have internal predecessors, (23), 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-04 10:32:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-04 10:32:02,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 5 [2025-03-04 10:32:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:02,943 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-04 10:32:02,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-04 10:32:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-04 10:32:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:32:02,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:02,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:32:02,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:02,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:02,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1448602077, now seen corresponding path program 1 times [2025-03-04 10:32:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628400280] [2025-03-04 10:32:02,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:02,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:32:02,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:32:02,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:02,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:02,965 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-04 10:32:02,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:02,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628400280] [2025-03-04 10:32:02,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628400280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:02,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:02,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:02,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223995890] [2025-03-04 10:32:02,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:02,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:02,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:02,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:02,967 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 2 states have (on average 3.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-04 10:32:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:02,981 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-04 10:32:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-04 10:32:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:02,982 INFO L225 Difference]: With dead ends: 21 [2025-03-04 10:32:02,982 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 10:32:02,982 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-04 10:32:02,982 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 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-04 10:32:02,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 10:32:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-04 10:32:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-04 10:32:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-04 10:32:02,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 6 [2025-03-04 10:32:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:02,986 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-04 10:32:02,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-04 10:32:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-04 10:32:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:32:02,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:02,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:02,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1956991402, now seen corresponding path program 1 times [2025-03-04 10:32:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47323781] [2025-03-04 10:32:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:32:02,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:32:02,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:02,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:03,025 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-04 10:32:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47323781] [2025-03-04 10:32:03,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47323781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:03,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:03,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:03,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153765483] [2025-03-04 10:32:03,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:03,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:03,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:03,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:03,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:03,027 INFO L87 Difference]: Start difference. First operand 20 states and 22 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-04 10:32:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:03,039 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-04 10:32:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:03,040 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-04 10:32:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:03,040 INFO L225 Difference]: With dead ends: 20 [2025-03-04 10:32:03,040 INFO L226 Difference]: Without dead ends: 19 [2025-03-04 10:32:03,040 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-04 10:32:03,041 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:03,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-04 10:32:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-04 10:32:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 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-04 10:32:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-04 10:32:03,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2025-03-04 10:32:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:03,043 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-04 10:32:03,043 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-04 10:32:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-04 10:32:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:32:03,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:03,043 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:03,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:32:03,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:03,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash 60460664, now seen corresponding path program 1 times [2025-03-04 10:32:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914149914] [2025-03-04 10:32:03,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:03,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:32:03,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:32:03,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:03,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:03,098 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-04 10:32:03,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914149914] [2025-03-04 10:32:03,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914149914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:03,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278783054] [2025-03-04 10:32:03,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:03,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:03,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:03,102 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-04 10:32:03,104 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-04 10:32:03,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:32:03,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:32:03,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:03,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:03,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:32:03,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:03,189 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-04 10:32:03,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:03,222 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-04 10:32:03,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278783054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:03,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:03,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-04 10:32:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180814677] [2025-03-04 10:32:03,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:03,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:32:03,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:03,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:32:03,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:03,224 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-04 10:32:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:03,306 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-04 10:32:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:32:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 12 [2025-03-04 10:32:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:03,307 INFO L225 Difference]: With dead ends: 35 [2025-03-04 10:32:03,307 INFO L226 Difference]: Without dead ends: 24 [2025-03-04 10:32:03,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:03,308 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:03,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-04 10:32:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-04 10:32:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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-04 10:32:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-03-04 10:32:03,310 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2025-03-04 10:32:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:03,311 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-03-04 10:32:03,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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-04 10:32:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-03-04 10:32:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:32:03,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:03,311 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-03-04 10:32:03,317 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-04 10:32:03,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:03,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:03,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1252655343, now seen corresponding path program 1 times [2025-03-04 10:32:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432245196] [2025-03-04 10:32:03,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:03,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:32:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:32:03,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:03,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:03,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432245196] [2025-03-04 10:32:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432245196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852998680] [2025-03-04 10:32:03,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:03,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:03,574 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-04 10:32:03,575 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-04 10:32:03,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:32:03,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:32:03,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:03,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:03,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:32:03,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:03,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852998680] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:03,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 10:32:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584781266] [2025-03-04 10:32:03,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:03,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:32:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:03,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:32:03,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:03,677 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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-04 10:32:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:03,736 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2025-03-04 10:32:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:32:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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 18 [2025-03-04 10:32:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:03,737 INFO L225 Difference]: With dead ends: 79 [2025-03-04 10:32:03,738 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 10:32:03,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:32:03,739 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:03,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 45 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 10:32:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2025-03-04 10:32:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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-04 10:32:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2025-03-04 10:32:03,746 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 18 [2025-03-04 10:32:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:03,746 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2025-03-04 10:32:03,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 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-04 10:32:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2025-03-04 10:32:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:32:03,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:03,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:03,754 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-04 10:32:03,947 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,SelfDestructingSolverStorable5 [2025-03-04 10:32:03,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:03,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1209896016, now seen corresponding path program 1 times [2025-03-04 10:32:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:03,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298320449] [2025-03-04 10:32:03,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:03,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:32:03,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:32:03,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:03,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:32:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298320449] [2025-03-04 10:32:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298320449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121124849] [2025-03-04 10:32:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:04,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:04,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:04,012 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-04 10:32:04,013 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-04 10:32:04,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:32:04,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:32:04,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:04,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:04,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:32:04,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:04,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121124849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:04,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:04,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2025-03-04 10:32:04,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244102127] [2025-03-04 10:32:04,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:04,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:32:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:04,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:32:04,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:04,122 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 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-04 10:32:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:04,172 INFO L93 Difference]: Finished difference Result 160 states and 201 transitions. [2025-03-04 10:32:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:32:04,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 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 20 [2025-03-04 10:32:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:04,176 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:32:04,176 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 10:32:04,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:04,177 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:04,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 10:32:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 10:32:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 105 states have internal predecessors, (119), 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-04 10:32:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2025-03-04 10:32:04,183 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 20 [2025-03-04 10:32:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:04,184 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2025-03-04 10:32:04,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 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-04 10:32:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2025-03-04 10:32:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:32:04,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:04,184 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1] [2025-03-04 10:32:04,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:04,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:04,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1318625145, now seen corresponding path program 2 times [2025-03-04 10:32:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360873718] [2025-03-04 10:32:04,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:04,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:32:04,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:32:04,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:04,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:04,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360873718] [2025-03-04 10:32:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360873718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753313529] [2025-03-04 10:32:04,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:04,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:04,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:04,498 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-04 10:32:04,499 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-04 10:32:04,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 10:32:04,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:32:04,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:04,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:04,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:32:04,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:04,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753313529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:04,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 10:32:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172010714] [2025-03-04 10:32:04,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:04,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:04,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:04,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:04,701 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 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-04 10:32:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:04,820 INFO L93 Difference]: Finished difference Result 563 states and 656 transitions. [2025-03-04 10:32:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:32:04,820 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 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 42 [2025-03-04 10:32:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:04,823 INFO L225 Difference]: With dead ends: 563 [2025-03-04 10:32:04,823 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 10:32:04,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:04,824 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 60 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:04,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 82 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 10:32:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 370. [2025-03-04 10:32:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 368 states have (on average 1.1630434782608696) internal successors, (428), 369 states have internal predecessors, (428), 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-04 10:32:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 428 transitions. [2025-03-04 10:32:04,846 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 428 transitions. Word has length 42 [2025-03-04 10:32:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:04,847 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 428 transitions. [2025-03-04 10:32:04,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 16 states have internal predecessors, (83), 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-04 10:32:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 428 transitions. [2025-03-04 10:32:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:32:04,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:04,848 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1] [2025-03-04 10:32:04,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:05,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:05,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2114520880, now seen corresponding path program 2 times [2025-03-04 10:32:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890577703] [2025-03-04 10:32:05,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:05,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 10:32:05,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:32:05,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:05,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 44 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 10:32:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890577703] [2025-03-04 10:32:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890577703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789276469] [2025-03-04 10:32:05,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:05,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:05,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:05,129 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-04 10:32:05,130 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-04 10:32:05,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-04 10:32:05,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:32:05,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:05,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:05,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:05,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 44 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 10:32:05,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 44 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 10:32:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789276469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:05,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:32:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645695561] [2025-03-04 10:32:05,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:32:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:05,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:32:05,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:05,281 INFO L87 Difference]: Start difference. First operand 370 states and 428 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-04 10:32:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:05,322 INFO L93 Difference]: Finished difference Result 596 states and 691 transitions. [2025-03-04 10:32:05,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:32:05,323 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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 56 [2025-03-04 10:32:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:05,324 INFO L225 Difference]: With dead ends: 596 [2025-03-04 10:32:05,324 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 10:32:05,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:05,325 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:05,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 43 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 10:32:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-04 10:32:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 1.1341463414634145) internal successors, (279), 247 states have internal predecessors, (279), 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-04 10:32:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 279 transitions. [2025-03-04 10:32:05,342 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 279 transitions. Word has length 56 [2025-03-04 10:32:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:05,343 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 279 transitions. [2025-03-04 10:32:05,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-04 10:32:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 279 transitions. [2025-03-04 10:32:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 10:32:05,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:05,345 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 1, 1, 1] [2025-03-04 10:32:05,353 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-04 10:32:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:05,551 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1023166391, now seen corresponding path program 3 times [2025-03-04 10:32:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315133300] [2025-03-04 10:32:05,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:05,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 15 equivalence classes. [2025-03-04 10:32:05,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 10:32:05,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:32:05,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:05,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315133300] [2025-03-04 10:32:05,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315133300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:05,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976121979] [2025-03-04 10:32:05,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:05,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:05,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:05,848 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-04 10:32:05,850 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-04 10:32:05,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 15 equivalence classes. [2025-03-04 10:32:05,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 10:32:05,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-04 10:32:05,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:05,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:32:05,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:05,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:06,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976121979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:06,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-03-04 10:32:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474443029] [2025-03-04 10:32:06,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:06,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:32:06,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:06,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:32:06,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:32:06,361 INFO L87 Difference]: Start difference. First operand 248 states and 279 transitions. Second operand has 32 states, 31 states have (on average 5.774193548387097) internal successors, (179), 32 states have internal predecessors, (179), 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-04 10:32:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:06,587 INFO L93 Difference]: Finished difference Result 2229 states and 2600 transitions. [2025-03-04 10:32:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:32:06,587 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.774193548387097) internal successors, (179), 32 states have internal predecessors, (179), 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 90 [2025-03-04 10:32:06,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:06,594 INFO L225 Difference]: With dead ends: 2229 [2025-03-04 10:32:06,594 INFO L226 Difference]: Without dead ends: 2228 [2025-03-04 10:32:06,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:32:06,596 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 184 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:06,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 188 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-04 10:32:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 950. [2025-03-04 10:32:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 948 states have (on average 1.1645569620253164) internal successors, (1104), 949 states have internal predecessors, (1104), 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-04 10:32:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1104 transitions. [2025-03-04 10:32:06,642 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1104 transitions. Word has length 90 [2025-03-04 10:32:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:06,642 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1104 transitions. [2025-03-04 10:32:06,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.774193548387097) internal successors, (179), 32 states have internal predecessors, (179), 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-04 10:32:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1104 transitions. [2025-03-04 10:32:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:32:06,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:06,644 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 10, 10, 10, 5, 5, 5, 1, 1, 1] [2025-03-04 10:32:06,650 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-04 10:32:06,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:06,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:06,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1862700908, now seen corresponding path program 3 times [2025-03-04 10:32:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:06,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188464702] [2025-03-04 10:32:06,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:06,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 12 equivalence classes. [2025-03-04 10:32:06,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 56 of 92 statements. [2025-03-04 10:32:06,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:32:06,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 226 proven. 70 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-04 10:32:06,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188464702] [2025-03-04 10:32:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188464702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038612959] [2025-03-04 10:32:06,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:06,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:06,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:06,916 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-04 10:32:06,918 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-04 10:32:06,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 12 equivalence classes. [2025-03-04 10:32:06,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 56 of 92 statements. [2025-03-04 10:32:06,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:32:06,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:06,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:32:06,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 252 proven. 94 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 10:32:07,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 252 proven. 94 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 10:32:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038612959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:07,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 15 [2025-03-04 10:32:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966018313] [2025-03-04 10:32:07,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:07,113 INFO L87 Difference]: Start difference. First operand 950 states and 1104 transitions. Second operand has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 states have internal predecessors, (94), 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-04 10:32:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:07,212 INFO L93 Difference]: Finished difference Result 1581 states and 1950 transitions. [2025-03-04 10:32:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:32:07,213 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 states have internal predecessors, (94), 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 92 [2025-03-04 10:32:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:07,221 INFO L225 Difference]: With dead ends: 1581 [2025-03-04 10:32:07,221 INFO L226 Difference]: Without dead ends: 1580 [2025-03-04 10:32:07,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:07,223 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:07,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 55 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-04 10:32:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2025-03-04 10:32:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1578 states have (on average 1.161596958174905) internal successors, (1833), 1579 states have internal predecessors, (1833), 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-04 10:32:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1833 transitions. [2025-03-04 10:32:07,293 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 1833 transitions. Word has length 92 [2025-03-04 10:32:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:07,294 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 1833 transitions. [2025-03-04 10:32:07,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 16 states have internal predecessors, (94), 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-04 10:32:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1833 transitions. [2025-03-04 10:32:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 10:32:07,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:07,297 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 23, 14, 14, 14, 10, 10, 10, 1, 1, 1] [2025-03-04 10:32:07,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:07,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:07,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:07,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1716076639, now seen corresponding path program 4 times [2025-03-04 10:32:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:07,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003288592] [2025-03-04 10:32:07,498 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:07,507 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 146 statements into 2 equivalence classes. [2025-03-04 10:32:07,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 10:32:07,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:07,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 566 proven. 290 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 10:32:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003288592] [2025-03-04 10:32:07,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003288592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539844181] [2025-03-04 10:32:07,701 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:07,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:07,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:07,704 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-04 10:32:07,706 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-04 10:32:07,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 146 statements into 2 equivalence classes. [2025-03-04 10:32:07,745 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 10:32:07,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:07,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:07,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:32:07,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 566 proven. 290 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 10:32:07,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 566 proven. 290 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 10:32:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539844181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:08,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2025-03-04 10:32:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925534199] [2025-03-04 10:32:08,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:32:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:08,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:32:08,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:32:08,023 INFO L87 Difference]: Start difference. First operand 1580 states and 1833 transitions. Second operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 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-04 10:32:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:08,120 INFO L93 Difference]: Finished difference Result 2456 states and 2854 transitions. [2025-03-04 10:32:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:32:08,121 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 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 146 [2025-03-04 10:32:08,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:08,124 INFO L225 Difference]: With dead ends: 2456 [2025-03-04 10:32:08,124 INFO L226 Difference]: Without dead ends: 934 [2025-03-04 10:32:08,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:32:08,126 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:08,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 97 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-04 10:32:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2025-03-04 10:32:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 932 states have (on average 1.1448497854077253) internal successors, (1067), 933 states have internal predecessors, (1067), 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-04 10:32:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1067 transitions. [2025-03-04 10:32:08,147 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1067 transitions. Word has length 146 [2025-03-04 10:32:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:08,147 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1067 transitions. [2025-03-04 10:32:08,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 24 states have internal predecessors, (134), 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-04 10:32:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1067 transitions. [2025-03-04 10:32:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 10:32:08,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:08,149 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 1, 1, 1] [2025-03-04 10:32:08,157 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-04 10:32:08,350 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,SelfDestructingSolverStorable11 [2025-03-04 10:32:08,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1037126121, now seen corresponding path program 4 times [2025-03-04 10:32:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:08,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708283202] [2025-03-04 10:32:08,351 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:08,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-03-04 10:32:08,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 10:32:08,374 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 2730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:09,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708283202] [2025-03-04 10:32:09,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708283202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:09,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602373033] [2025-03-04 10:32:09,074 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:09,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:09,076 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-04 10:32:09,085 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-04 10:32:09,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-03-04 10:32:09,130 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 10:32:09,130 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:09,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:09,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:32:09,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 2730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:09,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 2730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602373033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:10,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2025-03-04 10:32:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309036332] [2025-03-04 10:32:10,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-04 10:32:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:10,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-04 10:32:10,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:32:10,300 INFO L87 Difference]: Start difference. First operand 934 states and 1067 transitions. Second operand has 64 states, 63 states have (on average 5.888888888888889) internal successors, (371), 64 states have internal predecessors, (371), 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-04 10:32:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:10,978 INFO L93 Difference]: Finished difference Result 16007 states and 18671 transitions. [2025-03-04 10:32:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-04 10:32:10,978 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 5.888888888888889) internal successors, (371), 64 states have internal predecessors, (371), 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 186 [2025-03-04 10:32:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:11,022 INFO L225 Difference]: With dead ends: 16007 [2025-03-04 10:32:11,022 INFO L226 Difference]: Without dead ends: 16006 [2025-03-04 10:32:11,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:32:11,026 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 387 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:11,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 392 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:32:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16006 states. [2025-03-04 10:32:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16006 to 4468. [2025-03-04 10:32:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 4466 states have (on average 1.164576802507837) internal successors, (5201), 4467 states have internal predecessors, (5201), 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-04 10:32:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 5201 transitions. [2025-03-04 10:32:11,328 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 5201 transitions. Word has length 186 [2025-03-04 10:32:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:11,328 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 5201 transitions. [2025-03-04 10:32:11,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 5.888888888888889) internal successors, (371), 64 states have internal predecessors, (371), 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-04 10:32:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 5201 transitions. [2025-03-04 10:32:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 10:32:11,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:11,331 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 35, 22, 22, 22, 14, 14, 14, 1, 1, 1] [2025-03-04 10:32:11,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:32:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:32:11,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1898674583, now seen corresponding path program 5 times [2025-03-04 10:32:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870090513] [2025-03-04 10:32:11,538 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:11,546 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 218 statements into 24 equivalence classes. [2025-03-04 10:32:11,574 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 10:32:11,574 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 10:32:11,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1214 proven. 1430 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 10:32:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870090513] [2025-03-04 10:32:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870090513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098888425] [2025-03-04 10:32:11,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:11,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:11,978 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-04 10:32:11,980 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-04 10:32:12,002 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 218 statements into 24 equivalence classes. [2025-03-04 10:32:12,038 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 10:32:12,039 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-04 10:32:12,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:12,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:32:12,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1214 proven. 1430 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 10:32:12,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3164 backedges. 1214 proven. 1430 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 10:32:12,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098888425] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:12,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:12,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2025-03-04 10:32:12,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100974836] [2025-03-04 10:32:12,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:12,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 10:32:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:12,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 10:32:12,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:32:12,742 INFO L87 Difference]: Start difference. First operand 4468 states and 5201 transitions. Second operand has 48 states, 48 states have (on average 5.791666666666667) internal successors, (278), 48 states have internal predecessors, (278), 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-04 10:32:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:12,944 INFO L93 Difference]: Finished difference Result 6824 states and 7954 transitions. [2025-03-04 10:32:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:32:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.791666666666667) internal successors, (278), 48 states have internal predecessors, (278), 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 218 [2025-03-04 10:32:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:12,951 INFO L225 Difference]: With dead ends: 6824 [2025-03-04 10:32:12,951 INFO L226 Difference]: Without dead ends: 2486 [2025-03-04 10:32:12,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:32:12,957 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:12,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 173 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-04 10:32:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2025-03-04 10:32:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2484 states have (on average 1.1509661835748792) internal successors, (2859), 2485 states have internal predecessors, (2859), 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-04 10:32:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 2859 transitions. [2025-03-04 10:32:13,029 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 2859 transitions. Word has length 218 [2025-03-04 10:32:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:13,030 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 2859 transitions. [2025-03-04 10:32:13,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.791666666666667) internal successors, (278), 48 states have internal predecessors, (278), 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-04 10:32:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 2859 transitions. [2025-03-04 10:32:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-04 10:32:13,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:13,035 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 59, 46, 46, 46, 14, 14, 14, 1, 1, 1] [2025-03-04 10:32:13,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:13,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:32:13,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:13,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1438942215, now seen corresponding path program 6 times [2025-03-04 10:32:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393328281] [2025-03-04 10:32:13,238 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:32:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:13,251 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 362 statements into 48 equivalence classes. [2025-03-04 10:32:13,271 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) and asserted 248 of 362 statements. [2025-03-04 10:32:13,271 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2025-03-04 10:32:13,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9332 backedges. 2728 proven. 574 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2025-03-04 10:32:13,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393328281] [2025-03-04 10:32:13,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393328281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249350548] [2025-03-04 10:32:13,571 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:32:13,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:13,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:13,573 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:13,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:32:13,599 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 362 statements into 48 equivalence classes. [2025-03-04 10:32:13,648 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) and asserted 248 of 362 statements. [2025-03-04 10:32:13,648 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2025-03-04 10:32:13,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:13,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:32:13,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9332 backedges. 2728 proven. 574 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2025-03-04 10:32:13,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9332 backedges. 2728 proven. 574 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2025-03-04 10:32:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249350548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:14,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:14,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-03-04 10:32:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76583777] [2025-03-04 10:32:14,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:14,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:32:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:14,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:32:14,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:32:14,015 INFO L87 Difference]: Start difference. First operand 2486 states and 2859 transitions. Second operand has 32 states, 31 states have (on average 6.0) internal successors, (186), 32 states have internal predecessors, (186), 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-04 10:32:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:14,144 INFO L93 Difference]: Finished difference Result 3431 states and 4123 transitions. [2025-03-04 10:32:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:32:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 6.0) internal successors, (186), 32 states have internal predecessors, (186), 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 362 [2025-03-04 10:32:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:14,153 INFO L225 Difference]: With dead ends: 3431 [2025-03-04 10:32:14,154 INFO L226 Difference]: Without dead ends: 3430 [2025-03-04 10:32:14,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 738 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:32:14,157 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:14,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2025-03-04 10:32:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3430. [2025-03-04 10:32:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3430 states, 3428 states have (on average 1.1537339556592765) internal successors, (3955), 3429 states have internal predecessors, (3955), 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-04 10:32:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 3955 transitions. [2025-03-04 10:32:14,215 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 3955 transitions. Word has length 362 [2025-03-04 10:32:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 3430 states and 3955 transitions. [2025-03-04 10:32:14,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 6.0) internal successors, (186), 32 states have internal predecessors, (186), 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-04 10:32:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 3955 transitions. [2025-03-04 10:32:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-04 10:32:14,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:14,221 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 1, 1, 1] [2025-03-04 10:32:14,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:32:14,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 239725865, now seen corresponding path program 5 times [2025-03-04 10:32:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731659974] [2025-03-04 10:32:14,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:14,431 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 63 equivalence classes. [2025-03-04 10:32:14,521 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 378 of 378 statements. [2025-03-04 10:32:14,525 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-04 10:32:14,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 11592 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:32:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731659974] [2025-03-04 10:32:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731659974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2025-03-04 10:32:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820111603] [2025-03-04 10:32:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:16,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-04 10:32:16,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:16,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-04 10:32:16,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:32:16,667 INFO L87 Difference]: Start difference. First operand 3430 states and 3955 transitions. Second operand has 64 states, 64 states have (on average 5.890625) internal successors, (377), 64 states have internal predecessors, (377), 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-04 10:32:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:17,056 INFO L93 Difference]: Finished difference Result 4155 states and 4800 transitions. [2025-03-04 10:32:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-04 10:32:17,056 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 5.890625) internal successors, (377), 64 states have internal predecessors, (377), 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 378 [2025-03-04 10:32:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:17,060 INFO L225 Difference]: With dead ends: 4155 [2025-03-04 10:32:17,060 INFO L226 Difference]: Without dead ends: 999 [2025-03-04 10:32:17,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:32:17,063 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 47 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:17,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 720 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:32:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-03-04 10:32:17,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 489. [2025-03-04 10:32:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.0122950819672132) internal successors, (494), 488 states have internal predecessors, (494), 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-04 10:32:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 494 transitions. [2025-03-04 10:32:17,073 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 494 transitions. Word has length 378 [2025-03-04 10:32:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:17,073 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 494 transitions. [2025-03-04 10:32:17,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.890625) internal successors, (377), 64 states have internal predecessors, (377), 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-04 10:32:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 494 transitions. [2025-03-04 10:32:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-04 10:32:17,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:17,077 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 75, 46, 46, 46, 30, 30, 30, 1, 1, 1] [2025-03-04 10:32:17,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:32:17,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:17,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1761932215, now seen corresponding path program 7 times [2025-03-04 10:32:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852165855] [2025-03-04 10:32:17,078 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:32:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-04 10:32:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-04 10:32:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 5486 proven. 6302 refuted. 0 times theorem prover too weak. 2552 trivial. 0 not checked. [2025-03-04 10:32:18,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852165855] [2025-03-04 10:32:18,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852165855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279589073] [2025-03-04 10:32:18,411 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:32:18,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:18,413 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:18,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:32:18,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-04 10:32:18,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-04 10:32:18,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:32:18,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 5486 proven. 6302 refuted. 0 times theorem prover too weak. 2552 trivial. 0 not checked. [2025-03-04 10:32:18,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 5486 proven. 6302 refuted. 0 times theorem prover too weak. 2552 trivial. 0 not checked. [2025-03-04 10:32:19,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279589073] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:19,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:19,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 53 [2025-03-04 10:32:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158149460] [2025-03-04 10:32:19,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:19,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-04 10:32:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:19,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-04 10:32:19,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 10:32:19,696 INFO L87 Difference]: Start difference. First operand 489 states and 494 transitions. Second operand has 53 states, 53 states have (on average 5.90566037735849) internal successors, (313), 53 states have internal predecessors, (313), 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-04 10:32:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:19,860 INFO L93 Difference]: Finished difference Result 668 states and 673 transitions. [2025-03-04 10:32:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 10:32:19,861 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.90566037735849) internal successors, (313), 53 states have internal predecessors, (313), 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 458 [2025-03-04 10:32:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:19,863 INFO L225 Difference]: With dead ends: 668 [2025-03-04 10:32:19,863 INFO L226 Difference]: Without dead ends: 489 [2025-03-04 10:32:19,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 963 GetRequests, 869 SyntacticMatches, 43 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 10:32:19,864 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:19,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-04 10:32:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-04 10:32:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 1.0020491803278688) internal successors, (489), 488 states have internal predecessors, (489), 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-04 10:32:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 489 transitions. [2025-03-04 10:32:19,876 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 489 transitions. Word has length 458 [2025-03-04 10:32:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:19,876 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 489 transitions. [2025-03-04 10:32:19,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.90566037735849) internal successors, (313), 53 states have internal predecessors, (313), 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-04 10:32:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 489 transitions. [2025-03-04 10:32:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-04 10:32:19,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:19,881 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 80, 51, 51, 51, 30, 30, 30, 1, 1, 1] [2025-03-04 10:32:19,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:32:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:32:20,085 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:20,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1526858105, now seen corresponding path program 8 times [2025-03-04 10:32:20,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:20,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192980331] [2025-03-04 10:32:20,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:20,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 488 statements into 2 equivalence classes. [2025-03-04 10:32:20,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 488 of 488 statements. [2025-03-04 10:32:20,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:20,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 16380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192980331] [2025-03-04 10:32:23,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192980331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:23,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167179479] [2025-03-04 10:32:23,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:23,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:23,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:23,096 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:23,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:32:23,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 488 statements into 2 equivalence classes. [2025-03-04 10:32:23,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 488 of 488 statements. [2025-03-04 10:32:23,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:23,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:23,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-04 10:32:23,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 16380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:23,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16380 backedges. 0 proven. 16380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167179479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:28,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2025-03-04 10:32:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726016132] [2025-03-04 10:32:28,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 164 states [2025-03-04 10:32:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:28,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2025-03-04 10:32:28,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2025-03-04 10:32:28,853 INFO L87 Difference]: Start difference. First operand 489 states and 489 transitions. Second operand has 164 states, 163 states have (on average 5.9815950920245395) internal successors, (975), 164 states have internal predecessors, (975), 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-04 10:32:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:30,700 INFO L93 Difference]: Finished difference Result 982 states and 1063 transitions. [2025-03-04 10:32:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2025-03-04 10:32:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 164 states, 163 states have (on average 5.9815950920245395) internal successors, (975), 164 states have internal predecessors, (975), 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 488 [2025-03-04 10:32:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:30,704 INFO L225 Difference]: With dead ends: 982 [2025-03-04 10:32:30,704 INFO L226 Difference]: Without dead ends: 981 [2025-03-04 10:32:30,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2025-03-04 10:32:30,707 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 543 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:30,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 504 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:32:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-03-04 10:32:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2025-03-04 10:32:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 1.0010204081632652) internal successors, (981), 980 states have internal predecessors, (981), 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-04 10:32:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 981 transitions. [2025-03-04 10:32:30,720 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 981 transitions. Word has length 488 [2025-03-04 10:32:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:30,721 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 981 transitions. [2025-03-04 10:32:30,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 164 states, 163 states have (on average 5.9815950920245395) internal successors, (975), 164 states have internal predecessors, (975), 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-04 10:32:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 981 transitions. [2025-03-04 10:32:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2025-03-04 10:32:30,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:30,727 INFO L218 NwaCegarLoop]: trace histogram [163, 163, 162, 112, 112, 112, 51, 51, 51, 1, 1, 1] [2025-03-04 10:32:30,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:32:30,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:32:30,931 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:32:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash -177732001, now seen corresponding path program 9 times [2025-03-04 10:32:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147400753] [2025-03-04 10:32:30,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:30,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:30,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 980 statements into 113 equivalence classes. [2025-03-04 10:32:31,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 113 check-sat command(s) and asserted 980 of 980 statements. [2025-03-04 10:32:31,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 113 check-sat command(s) [2025-03-04 10:32:31,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 67794 backedges. 54840 proven. 12752 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 10:32:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147400753] [2025-03-04 10:32:40,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147400753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:40,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064887356] [2025-03-04 10:32:40,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:40,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:40,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:40,457 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:40,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:32:40,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 980 statements into 113 equivalence classes. [2025-03-04 10:32:40,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 113 check-sat command(s) and asserted 980 of 980 statements. [2025-03-04 10:32:40,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 113 check-sat command(s) [2025-03-04 10:32:40,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:40,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 164 conjuncts are in the unsatisfiable core [2025-03-04 10:32:40,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 67794 backedges. 54840 proven. 12752 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 10:32:41,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 67794 backedges. 54840 proven. 12752 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 10:32:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064887356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:45,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 173 [2025-03-04 10:32:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052441364] [2025-03-04 10:32:45,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:45,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 173 states [2025-03-04 10:32:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:45,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2025-03-04 10:32:45,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2025-03-04 10:32:45,560 INFO L87 Difference]: Start difference. First operand 981 states and 981 transitions. Second operand has 173 states, 173 states have (on average 7.734104046242774) internal successors, (1338), 173 states have internal predecessors, (1338), 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-04 10:32:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:46,224 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2025-03-04 10:32:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 10:32:46,224 INFO L78 Accepts]: Start accepts. Automaton has has 173 states, 173 states have (on average 7.734104046242774) internal successors, (1338), 173 states have internal predecessors, (1338), 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 980 [2025-03-04 10:32:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:46,226 INFO L225 Difference]: With dead ends: 981 [2025-03-04 10:32:46,226 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:32:46,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2123 GetRequests, 1899 SyntacticMatches, 53 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20867 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2025-03-04 10:32:46,229 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:46,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:32:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:32:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04 10:32:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:32:46,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 980 [2025-03-04 10:32:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:46,230 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:32:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 173 states, 173 states have (on average 7.734104046242774) internal successors, (1338), 173 states have internal predecessors, (1338), 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-04 10:32:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:32:46,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:32:46,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 10:32:46,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 10:32:46,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 10:32:46,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 10:32:46,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 10:32:46,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 10:32:46,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:46,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:46,436 INFO L422 BasicCegarLoop]: Path program histogram: [9, 5, 1, 1, 1, 1, 1] [2025-03-04 10:32:46,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:32:47,662 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:32:47,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:32:47 BoogieIcfgContainer [2025-03-04 10:32:47,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:32:47,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:32:47,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:32:47,697 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:32:47,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:02" (3/4) ... [2025-03-04 10:32:47,701 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:32:47,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 10:32:47,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:32:47,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 10:32:47,764 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:32:47,765 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:32:47,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:32:47,766 INFO L158 Benchmark]: Toolchain (without parser) took 45454.23ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 114.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 316.7MB. Max. memory is 16.1GB. [2025-03-04 10:32:47,766 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:32:47,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 124.77ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 105.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:32:47,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.82ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 104.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:32:47,768 INFO L158 Benchmark]: Boogie Preprocessor took 10.20ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 103.4MB in the end (delta: 540.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:32:47,768 INFO L158 Benchmark]: IcfgBuilder took 155.95ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 93.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:32:47,768 INFO L158 Benchmark]: TraceAbstraction took 45073.55ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 92.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 987.8MB. Max. memory is 16.1GB. [2025-03-04 10:32:47,768 INFO L158 Benchmark]: Witness Printer took 68.21ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:32:47,771 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 124.77ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 105.2MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.82ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 104.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 10.20ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 103.4MB in the end (delta: 540.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 155.95ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 93.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 45073.55ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 92.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 987.8MB. Max. memory is 16.1GB. * Witness Printer took 68.21ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 43.8s, OverallIterations: 19, TraceHistogramMax: 163, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1354 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1354 mSDsluCounter, 3220 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2760 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3512 IncrementalHoareTripleChecker+Invalid, 3797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 460 mSDtfsCounter, 3512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6816 GetRequests, 6018 SyntacticMatches, 96 SemanticMatches, 702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21976 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4468occurred in iteration=13, InterpolantAutomatonStates: 617, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 13535 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 6737 NumberOfCodeBlocks, 6437 NumberOfCodeBlocksAsserted, 469 NumberOfCheckSat, 9858 ConstructedInterpolants, 0 QuantifiedInterpolants, 26682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5050 ConjunctsInSsa, 427 ConjunctsInUnsatCore, 47 InterpolantComputations, 5 PerfectInterpolantSequences, 237308/361298 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 18]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x == 50) && (y <= 50)) || (((y <= 24) && (61 <= x)) && (x <= 78))) || (((x <= 64) && (y <= 38)) && (61 <= x))) || (((y <= 37) && (61 <= x)) && (x <= 65))) || (((x <= 63) && (y <= 39)) && (61 <= x))) || ((31 == x) && (y <= 31))) || ((y <= 40) && (40 == x))) || ((x == 11) && (y <= 11))) || ((x == 8) && (y <= 8))) || ((x == 36) && (y <= 36))) || (((y <= 5) && (61 <= x)) && (x <= 2147483582))) || ((x == 1) && (y <= 1))) || ((y <= 46) && (46 == x))) || (((61 <= x) && (x <= 68)) && (y <= 34))) || ((y <= 47) && (47 == x))) || ((y <= 12) && (x == 12))) || ((x == 13) && (y <= 13))) || ((y <= 45) && (57 == x))) || (((x <= 2147483584) && (61 <= x)) && (y <= 3))) || (((61 <= x) && (y <= 33)) && (x <= 69))) || ((y <= 47) && (x == 55))) || ((2 == x) && (y <= 2))) || (((x <= 2147483587) && (61 <= x)) && (y <= 0))) || ((y <= 29) && (29 == x))) || (((y <= 15) && (x <= 2147483572)) && (61 <= x))) || ((x == 38) && (y <= 38))) || (((61 <= x) && (x <= 79)) && (y <= 23))) || ((16 == x) && (y <= 16))) || ((y <= 44) && (x == 58))) || (((x <= 2147483570) && (61 <= x)) && (y <= 17))) || (((x <= 2147483567) && (61 <= x)) && (y <= 20))) || (((x <= 70) && (61 <= x)) && (y <= 32))) || (((x <= 67) && (y <= 35)) && (61 <= x))) || ((53 == x) && (y <= 49))) || ((y <= 7) && (7 == x))) || ((y <= 39) && (x == 39))) || (((61 <= x) && (y <= 21)) && (x <= 2147483566))) || ((y <= 25) && (x == 25))) || ((5 == x) && (y <= 5))) || ((x == 34) && (y <= 34))) || ((y <= 48) && (x == 48))) || (((x <= 75) && (y <= 27)) && (61 <= x))) || (((y <= 26) && (x <= 76)) && (61 <= x))) || (((y <= 40) && (x <= 62)) && (61 <= x))) || (((61 <= x) && (x <= 72)) && (y <= 30))) || (((y <= 10) && (61 <= x)) && (x <= 2147483577))) || ((22 == x) && (y <= 22))) || (((x <= 2147483571) && (61 <= x)) && (y <= 16))) || ((y <= 15) && (x == 15))) || ((x == 61) && (y <= 41))) || (((y <= 4) && (61 <= x)) && (x <= 2147483583))) || (((y <= 18) && (x <= 2147483569)) && (61 <= x))) || ((y <= 6) && (6 == x))) || ((y <= 28) && (x == 28))) || ((19 == x) && (y <= 19))) || (((61 <= x) && (y <= 9)) && (x <= 2147483578))) || ((y <= 4) && (x == 4))) || ((y <= 24) && (x == 24))) || ((y <= 21) && (21 == x))) || ((3 == x) && (y <= 3))) || (((61 <= x) && (x <= 77)) && (y <= 25))) || (((y <= 7) && (61 <= x)) && (x <= 2147483580))) || ((y <= 45) && (x == 45))) || ((y <= 42) && (42 == x))) || ((y <= 17) && (x == 17))) || ((y <= 43) && (59 == x))) || (((x <= 66) && (61 <= x)) && (y <= 36))) || (((61 <= x) && (y <= 22)) && (x <= 80))) || (((x <= 2147483573) && (61 <= x)) && (y <= 14))) || ((y == 0) && (x == 0))) || ((y <= 33) && (x == 33))) || (((61 <= x) && (x <= 2147483568)) && (y <= 19))) || ((y <= 20) && (x == 20))) || ((y <= 10) && (x == 10))) || (((x <= 2147483579) && (61 <= x)) && (y <= 8))) || ((y <= 44) && (44 == x))) || ((y <= 27) && (x == 27))) || (((y <= 12) && (61 <= x)) && (x <= 2147483575))) || ((56 == x) && (y <= 46))) || (((y <= 28) && (x <= 74)) && (61 <= x))) || (((((long) y + 1) <= 0) && (61 <= x)) && (x <= 2147483588))) || ((49 == x) && (y <= 49))) || (((x <= 2147483581) && (61 <= x)) && (y <= 6))) || ((y <= 43) && (x == 43))) || ((41 == x) && (y <= 41))) || ((y <= 35) && (35 == x))) || ((32 == x) && (y <= 32))) || ((y <= 48) && (x == 54))) || (((61 <= x) && (x <= 71)) && (y <= 31))) || ((y <= 14) && (14 == x))) || ((y <= 30) && (30 == x))) || ((23 == x) && (y <= 23))) || ((9 == x) && (y <= 9))) || (((x <= 2147483576) && (61 <= x)) && (y <= 11))) || (((61 <= x) && (y <= 13)) && (x <= 2147483574))) || (((y <= 2) && (61 <= x)) && (x <= 2147483585))) || ((y <= 37) && (x == 37))) || (((61 <= x) && (x <= 73)) && (y <= 29))) || ((x == 60) && (y <= 42))) || ((52 == x) && (y <= 50))) || ((y <= 26) && (x == 26))) || ((y <= 18) && (x == 18))) || ((51 == x) && (y <= 51))) || (((61 <= x) && (x <= 2147483586)) && (y <= 1))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:32:47,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE