./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:02:02,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:02:02,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:02:02,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:02:02,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:02:02,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:02:02,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:02:02,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:02:02,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:02:02,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:02:02,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:02:02,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:02:02,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:02:02,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:02:02,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:02:02,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:02:02,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:02:02,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:02:02,535 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 [2025-03-17 15:02:02,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:02:02,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:02:02,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:02:02,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:02:02,764 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:02:02,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2025-03-17 15:02:03,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f63ed378/b9fe11c32fa644acbcfa01668853a6f6/FLAG317526ba9 [2025-03-17 15:02:04,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:02:04,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2025-03-17 15:02:04,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f63ed378/b9fe11c32fa644acbcfa01668853a6f6/FLAG317526ba9 [2025-03-17 15:02:04,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f63ed378/b9fe11c32fa644acbcfa01668853a6f6 [2025-03-17 15:02:04,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:02:04,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:02:04,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:02:04,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:02:04,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:02:04,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474c63f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04, skipping insertion in model container [2025-03-17 15:02:04,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:02:04,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:02:04,566 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:02:04,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:02:04,587 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:02:04,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04 WrapperNode [2025-03-17 15:02:04,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:02:04,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:02:04,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:02:04,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:02:04,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,610 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 36 [2025-03-17 15:02:04,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:02:04,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:02:04,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:02:04,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:02:04,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,624 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:02:04,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:02:04,635 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:02:04,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:02:04,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:02:04,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (1/1) ... [2025-03-17 15:02:04,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:02:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:04,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:02:04,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:02:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:02:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:02:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:02:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:02:04,725 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:02:04,726 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:02:04,805 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 15:02:04,805 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:02:04,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:02:04,810 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:02:04,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:04 BoogieIcfgContainer [2025-03-17 15:02:04,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:02:04,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:02:04,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:02:04,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:02:04,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:02:04" (1/3) ... [2025-03-17 15:02:04,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c75b3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:04, skipping insertion in model container [2025-03-17 15:02:04,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:04" (2/3) ... [2025-03-17 15:02:04,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c75b3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:04, skipping insertion in model container [2025-03-17 15:02:04,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:04" (3/3) ... [2025-03-17 15:02:04,817 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2025-03-17 15:02:04,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:02:04,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark23_conjunctive.i that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-17 15:02:04,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:02:04,871 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;@6f836008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:02:04,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 15:02:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 15:02:04,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:04,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 15:02:04,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1568895, now seen corresponding path program 1 times [2025-03-17 15:02:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610370401] [2025-03-17 15:02:04,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:04,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 15:02:04,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 15:02:04,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:04,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610370401] [2025-03-17 15:02:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610370401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:05,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:05,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:02:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120892093] [2025-03-17 15:02:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:05,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:02:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:05,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:02:05,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:05,039 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 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, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:05,070 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-03-17 15:02:05,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:02:05,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-17 15:02:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:05,077 INFO L225 Difference]: With dead ends: 22 [2025-03-17 15:02:05,077 INFO L226 Difference]: Without dead ends: 10 [2025-03-17 15:02:05,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:05,080 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:05,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-17 15:02:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-17 15:02:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-17 15:02:05,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2025-03-17 15:02:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:05,110 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-17 15:02:05,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-17 15:02:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:02:05,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:05,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:02:05,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:02:05,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:05,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash 48635728, now seen corresponding path program 1 times [2025-03-17 15:02:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:05,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800016929] [2025-03-17 15:02:05,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:05,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:02:05,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:02:05,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:05,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800016929] [2025-03-17 15:02:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800016929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:02:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785887339] [2025-03-17 15:02:05,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:05,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:02:05,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:05,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:02:05,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:05,161 INFO L87 Difference]: Start difference. First operand 10 states and 10 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-17 15:02:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:05,173 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-17 15:02:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:02:05,174 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-17 15:02:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:05,174 INFO L225 Difference]: With dead ends: 14 [2025-03-17 15:02:05,174 INFO L226 Difference]: Without dead ends: 13 [2025-03-17 15:02:05,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:02:05,175 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:05,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-17 15:02:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-17 15:02:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-17 15:02:05,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2025-03-17 15:02:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:05,178 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-17 15:02:05,178 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-17 15:02:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-17 15:02:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:02:05,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:05,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:02:05,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:02:05,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:05,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1507707549, now seen corresponding path program 1 times [2025-03-17 15:02:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924585381] [2025-03-17 15:02:05,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:05,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:02:05,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:02:05,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924585381] [2025-03-17 15:02:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924585381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:05,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:05,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451810465] [2025-03-17 15:02:05,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:05,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:05,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:05,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:05,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:05,248 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:05,268 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-17 15:02:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:02:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:05,269 INFO L225 Difference]: With dead ends: 13 [2025-03-17 15:02:05,269 INFO L226 Difference]: Without dead ends: 12 [2025-03-17 15:02:05,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:05,270 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:05,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-17 15:02:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-17 15:02:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-17 15:02:05,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2025-03-17 15:02:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:05,273 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-17 15:02:05,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-17 15:02:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:02:05,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:05,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:05,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:02:05,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:05,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash -505706258, now seen corresponding path program 1 times [2025-03-17 15:02:05,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:05,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893430025] [2025-03-17 15:02:05,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:05,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:02:05,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:02:05,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:05,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:05,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893430025] [2025-03-17 15:02:05,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893430025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:05,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:05,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662654186] [2025-03-17 15:02:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:05,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:05,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:05,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:05,329 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:05,356 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-17 15:02:05,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:05,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:02:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:05,357 INFO L225 Difference]: With dead ends: 15 [2025-03-17 15:02:05,357 INFO L226 Difference]: Without dead ends: 14 [2025-03-17 15:02:05,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:05,360 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:05,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-17 15:02:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 15:02:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-17 15:02:05,365 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-17 15:02:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:05,365 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-17 15:02:05,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-17 15:02:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:02:05,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:05,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 15:02:05,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:02:05,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:05,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1250129315, now seen corresponding path program 1 times [2025-03-17 15:02:05,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:05,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30930287] [2025-03-17 15:02:05,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:05,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:05,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:02:05,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:02:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:05,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30930287] [2025-03-17 15:02:05,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30930287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:05,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221172827] [2025-03-17 15:02:05,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:05,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:05,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:05,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:05,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:02:05,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:02:05,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:02:05,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:05,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:02:05,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221172827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:05,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:05,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 15:02:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361634113] [2025-03-17 15:02:05,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:05,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:02:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:05,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:02:05,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:02:05,532 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:05,552 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-17 15:02:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:02:05,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 10 [2025-03-17 15:02:05,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:05,553 INFO L225 Difference]: With dead ends: 30 [2025-03-17 15:02:05,553 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 15:02:05,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:02:05,554 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:05,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 15:02:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-17 15:02:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-17 15:02:05,558 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 10 [2025-03-17 15:02:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:05,558 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-17 15:02:05,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-17 15:02:05,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 15:02:05,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:05,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 15:02:05,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:02:05,759 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-17 15:02:05,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:05,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1216571775, now seen corresponding path program 1 times [2025-03-17 15:02:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322296940] [2025-03-17 15:02:05,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:02:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:05,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 15:02:05,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 15:02:05,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:05,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:02:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:05,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322296940] [2025-03-17 15:02:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322296940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:02:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:02:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:02:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057414674] [2025-03-17 15:02:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:02:05,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:02:05,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:05,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:02:05,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:05,803 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:05,815 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-03-17 15:02:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:02:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-17 15:02:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:05,817 INFO L225 Difference]: With dead ends: 27 [2025-03-17 15:02:05,817 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 15:02:05,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:02:05,818 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 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-17 15:02:05,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 15:02:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 15:02:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 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-17 15:02:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-03-17 15:02:05,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 12 [2025-03-17 15:02:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:05,821 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-03-17 15:02:05,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-03-17 15:02:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:02:05,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:05,821 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1] [2025-03-17 15:02:05,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:02:05,822 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:05,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash -627785968, now seen corresponding path program 2 times [2025-03-17 15:02:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393677042] [2025-03-17 15:02:05,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:05,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 15:02:05,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:02:05,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393677042] [2025-03-17 15:02:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393677042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:05,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470493075] [2025-03-17 15:02:05,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:02:05,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:05,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:05,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:05,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:02:05,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-17 15:02:05,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:02:05,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:02:05,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:05,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:02:05,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:06,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:06,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470493075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:06,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:06,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 15:02:06,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102279014] [2025-03-17 15:02:06,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:06,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:02:06,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:06,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:02:06,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:02:06,095 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:06,135 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2025-03-17 15:02:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:02:06,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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 25 [2025-03-17 15:02:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:06,136 INFO L225 Difference]: With dead ends: 57 [2025-03-17 15:02:06,136 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 15:02:06,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 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-17 15:02:06,136 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:06,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:02:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 15:02:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 15:02:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2025-03-17 15:02:06,141 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 25 [2025-03-17 15:02:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:06,141 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2025-03-17 15:02:06,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2025-03-17 15:02:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:02:06,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:06,142 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1] [2025-03-17 15:02:06,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:02:06,343 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,SelfDestructingSolverStorable6 [2025-03-17 15:02:06,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:06,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash -833840464, now seen corresponding path program 3 times [2025-03-17 15:02:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710057110] [2025-03-17 15:02:06,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:06,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 11 equivalence classes. [2025-03-17 15:02:06,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:02:06,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:06,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710057110] [2025-03-17 15:02:06,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710057110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622331793] [2025-03-17 15:02:06,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:02:06,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:06,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:06,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:06,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:02:06,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 11 equivalence classes. [2025-03-17 15:02:06,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:02:06,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:02:06,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:06,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:02:06,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:06,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:06,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622331793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:06,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:06,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-17 15:02:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546678129] [2025-03-17 15:02:06,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:06,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 15:02:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:06,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 15:02:06,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:02:06,945 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:07,020 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2025-03-17 15:02:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:02:07,021 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 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 55 [2025-03-17 15:02:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:07,021 INFO L225 Difference]: With dead ends: 117 [2025-03-17 15:02:07,022 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 15:02:07,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 98 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-17 15:02:07,023 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:07,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 15:02:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 15:02:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.008695652173913) internal successors, (116), 115 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2025-03-17 15:02:07,036 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 55 [2025-03-17 15:02:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:07,036 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2025-03-17 15:02:07,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.739130434782608) internal successors, (109), 24 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2025-03-17 15:02:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 15:02:07,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:07,038 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1] [2025-03-17 15:02:07,044 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-17 15:02:07,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:07,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:07,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash 899287536, now seen corresponding path program 4 times [2025-03-17 15:02:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697640254] [2025-03-17 15:02:07,243 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:02:07,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:07,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-17 15:02:07,266 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 15:02:07,266 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:02:07,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:07,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697640254] [2025-03-17 15:02:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697640254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:07,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906997160] [2025-03-17 15:02:07,809 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:02:07,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:07,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:07,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:07,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:02:07,836 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 115 statements into 2 equivalence classes. [2025-03-17 15:02:07,862 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 15:02:07,862 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:02:07,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:07,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:02:07,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:08,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906997160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:08,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-17 15:02:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822166979] [2025-03-17 15:02:08,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:08,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 15:02:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:08,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 15:02:08,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:02:08,734 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand has 48 states, 47 states have (on average 4.872340425531915) internal successors, (229), 48 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:08,857 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2025-03-17 15:02:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 15:02:08,858 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.872340425531915) internal successors, (229), 48 states have internal predecessors, (229), 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 115 [2025-03-17 15:02:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:08,859 INFO L225 Difference]: With dead ends: 237 [2025-03-17 15:02:08,859 INFO L226 Difference]: Without dead ends: 236 [2025-03-17 15:02:08,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:02:08,861 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:08,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:02:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-17 15:02:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-17 15:02:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.004255319148936) internal successors, (236), 235 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2025-03-17 15:02:08,880 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 115 [2025-03-17 15:02:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:08,881 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2025-03-17 15:02:08,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.872340425531915) internal successors, (229), 48 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2025-03-17 15:02:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-17 15:02:08,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:08,883 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1] [2025-03-17 15:02:08,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:02:09,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:09,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:09,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:09,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1434699888, now seen corresponding path program 5 times [2025-03-17 15:02:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:09,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653763763] [2025-03-17 15:02:09,085 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:02:09,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:09,101 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 235 statements into 47 equivalence classes. [2025-03-17 15:02:09,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 15:02:09,171 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:02:09,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:10,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653763763] [2025-03-17 15:02:10,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653763763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:10,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029992987] [2025-03-17 15:02:10,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:02:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:10,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:10,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:02:10,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 235 statements into 47 equivalence classes. [2025-03-17 15:02:10,857 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 15:02:10,857 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:02:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:10,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 15:02:10,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:11,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029992987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:13,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-17 15:02:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289997507] [2025-03-17 15:02:13,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:13,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-17 15:02:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:13,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 15:02:13,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 15:02:13,322 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand has 96 states, 95 states have (on average 4.936842105263158) internal successors, (469), 96 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:13,652 INFO L93 Difference]: Finished difference Result 477 states and 524 transitions. [2025-03-17 15:02:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 15:02:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.936842105263158) internal successors, (469), 96 states have internal predecessors, (469), 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 235 [2025-03-17 15:02:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:13,654 INFO L225 Difference]: With dead ends: 477 [2025-03-17 15:02:13,655 INFO L226 Difference]: Without dead ends: 476 [2025-03-17 15:02:13,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 15:02:13,657 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:13,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 288 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:02:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-17 15:02:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2025-03-17 15:02:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.0021052631578948) internal successors, (476), 475 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 476 transitions. [2025-03-17 15:02:13,674 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 476 transitions. Word has length 235 [2025-03-17 15:02:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:13,675 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 476 transitions. [2025-03-17 15:02:13,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.936842105263158) internal successors, (469), 96 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 476 transitions. [2025-03-17 15:02:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-17 15:02:13,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:13,682 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1] [2025-03-17 15:02:13,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:02:13,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 15:02:13,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:13,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2102576496, now seen corresponding path program 6 times [2025-03-17 15:02:13,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:13,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523117026] [2025-03-17 15:02:13,885 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:02:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:13,897 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 475 statements into 95 equivalence classes. [2025-03-17 15:02:14,104 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 475 of 475 statements. [2025-03-17 15:02:14,104 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 15:02:14,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523117026] [2025-03-17 15:02:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523117026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395263187] [2025-03-17 15:02:18,764 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:02:18,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:18,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:18,769 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:18,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:02:18,816 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 475 statements into 95 equivalence classes. [2025-03-17 15:02:19,007 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 475 of 475 statements. [2025-03-17 15:02:19,008 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 15:02:19,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:19,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 15:02:19,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:02:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:19,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395263187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:26,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:26,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-17 15:02:26,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928558639] [2025-03-17 15:02:26,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:26,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-17 15:02:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:26,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-17 15:02:26,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 15:02:26,660 INFO L87 Difference]: Start difference. First operand 476 states and 476 transitions. Second operand has 192 states, 191 states have (on average 4.968586387434555) internal successors, (949), 192 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:02:27,351 INFO L93 Difference]: Finished difference Result 957 states and 1052 transitions. [2025-03-17 15:02:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-17 15:02:27,352 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 4.968586387434555) internal successors, (949), 192 states have internal predecessors, (949), 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 475 [2025-03-17 15:02:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:02:27,355 INFO L225 Difference]: With dead ends: 957 [2025-03-17 15:02:27,355 INFO L226 Difference]: Without dead ends: 956 [2025-03-17 15:02:27,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 15:02:27,357 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:02:27,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 576 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:02:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-17 15:02:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2025-03-17 15:02:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 1.0010471204188482) internal successors, (956), 955 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 956 transitions. [2025-03-17 15:02:27,379 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 956 transitions. Word has length 475 [2025-03-17 15:02:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:02:27,380 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 956 transitions. [2025-03-17 15:02:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 4.968586387434555) internal successors, (949), 192 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:02:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 956 transitions. [2025-03-17 15:02:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2025-03-17 15:02:27,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:02:27,396 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 1, 1, 1] [2025-03-17 15:02:27,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:02:27,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:27,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:02:27,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:02:27,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1025589392, now seen corresponding path program 7 times [2025-03-17 15:02:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:02:27,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731257535] [2025-03-17 15:02:27,601 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 15:02:27,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:02:27,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 955 statements into 1 equivalence classes. [2025-03-17 15:02:27,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 955 of 955 statements. [2025-03-17 15:02:27,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:27,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 0 proven. 90345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:02:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731257535] [2025-03-17 15:02:46,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731257535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:02:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668092051] [2025-03-17 15:02:46,966 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 15:02:46,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:02:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:02:46,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:02:46,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:02:47,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 955 statements into 1 equivalence classes. [2025-03-17 15:02:47,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 955 of 955 statements. [2025-03-17 15:02:47,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:02:47,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:02:47,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 202 conjuncts are in the unsatisfiable core [2025-03-17 15:02:47,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:03:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 90345 backedges. 70140 proven. 0 refuted. 0 times theorem prover too weak. 20205 trivial. 0 not checked. [2025-03-17 15:03:05,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:03:05,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668092051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:03:05,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:03:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [203] imperfect sequences [192] total 394 [2025-03-17 15:03:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220781747] [2025-03-17 15:03:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:03:05,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 203 states [2025-03-17 15:03:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:03:05,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2025-03-17 15:03:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2025-03-17 15:03:05,554 INFO L87 Difference]: Start difference. First operand 956 states and 956 transitions. Second operand has 203 states, 203 states have (on average 2.5073891625615765) internal successors, (509), 203 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:03:08,844 INFO L93 Difference]: Finished difference Result 956 states and 956 transitions. [2025-03-17 15:03:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2025-03-17 15:03:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 203 states, 203 states have (on average 2.5073891625615765) internal successors, (509), 203 states have internal predecessors, (509), 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 955 [2025-03-17 15:03:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:03:08,846 INFO L225 Difference]: With dead ends: 956 [2025-03-17 15:03:08,846 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:03:08,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1146 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=28930, Invalid=125912, Unknown=0, NotChecked=0, Total=154842 [2025-03-17 15:03:08,857 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 4926 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 4926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:03:08,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1150 Invalid, 4926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4926 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 15:03:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:03:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:03:08,857 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-17 15:03:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:03:08,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 955 [2025-03-17 15:03:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:03:08,858 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:03:08,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 203 states, 203 states have (on average 2.5073891625615765) internal successors, (509), 203 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:03:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:03:08,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:03:08,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-17 15:03:08,863 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-17 15:03:08,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-17 15:03:08,865 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-17 15:03:08,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:03:09,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:03:09,068 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2025-03-17 15:03:09,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:03:10,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:03:10,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:03:10 BoogieIcfgContainer [2025-03-17 15:03:10,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:03:10,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:03:10,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:03:10,111 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:03:10,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:04" (3/4) ... [2025-03-17 15:03:10,113 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:03:10,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-17 15:03:10,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:03:10,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:03:10,122 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:03:10,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:03:10,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:03:10,176 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:03:10,177 INFO L158 Benchmark]: Toolchain (without parser) took 65727.92ms. Allocated memory was 201.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 153.7MB in the beginning and 1.0GB in the end (delta: -881.5MB). Peak memory consumption was 262.4MB. Max. memory is 16.1GB. [2025-03-17 15:03:10,177 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:03:10,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.56ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 143.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:03:10,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.03ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:03:10,177 INFO L158 Benchmark]: Boogie Preprocessor took 22.93ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 141.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:03:10,178 INFO L158 Benchmark]: IcfgBuilder took 176.40ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 130.4MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:03:10,178 INFO L158 Benchmark]: TraceAbstraction took 65298.34ms. Allocated memory was 201.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 129.7MB in the beginning and 1.0GB in the end (delta: -913.9MB). Peak memory consumption was 782.9MB. Max. memory is 16.1GB. [2025-03-17 15:03:10,178 INFO L158 Benchmark]: Witness Printer took 65.21ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:03:10,179 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.35ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.56ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 143.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.03ms. Allocated memory is still 201.3MB. Free memory was 143.4MB in the beginning and 142.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.93ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 141.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 176.40ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 130.4MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 65298.34ms. Allocated memory was 201.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 129.7MB in the beginning and 1.0GB in the end (delta: -913.9MB). Peak memory consumption was 782.9MB. Max. memory is 16.1GB. * Witness Printer took 65.21ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB 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: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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: 24]: 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, 18 locations, 21 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 64.2s, OverallIterations: 12, TraceHistogramMax: 191, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 2342 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2171 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5783 IncrementalHoareTripleChecker+Invalid, 5792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 171 mSDtfsCounter, 5783 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3165 GetRequests, 2399 SyntacticMatches, 0 SemanticMatches, 766 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48090 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=11, InterpolantAutomatonStates: 599, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 56.2s InterpolantComputationTime, 3774 NumberOfCodeBlocks, 3774 NumberOfCodeBlocksAsserted, 323 NumberOfCheckSat, 4664 ConstructedInterpolants, 0 QuantifiedInterpolants, 13034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4233 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 90350/267608 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 4 specifications checked. All of them hold - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j <= 118) && (0 <= (j + 2147483648))) && (59 <= i)) || (((0 <= (j + 2147483648)) && (j <= 2147483459)) && (96 <= i))) || (((j <= 138) && (0 <= (j + 2147483648))) && (69 <= i))) || (((0 <= (j + 2147483648)) && (35 <= i)) && (j <= 70))) || (((0 <= (j + 2147483648)) && (65 <= i)) && (j <= 130))) || (((0 <= (j + 2147483648)) && (j <= 146)) && (73 <= i))) || (((0 <= (j + 2147483648)) && (66 <= i)) && (j <= 132))) || (((0 <= (j + 2147483648)) && (j <= 182)) && (91 <= i))) || (((0 <= (j + 2147483648)) && (3 <= i)) && (j <= 6))) || (((0 <= (j + 2147483648)) && (j <= 8)) && (4 <= i))) || (((j <= 164) && (82 <= i)) && (0 <= (j + 2147483648)))) || (((0 <= (j + 2147483648)) && (89 <= i)) && (j <= 178))) || (((0 <= (j + 2147483648)) && (34 <= i)) && (j <= 68))) || (((44 <= i) && (0 <= (j + 2147483648))) && (j <= 88))) || (((0 <= (j + 2147483648)) && (93 <= i)) && (j <= 186))) || (((0 <= (j + 2147483648)) && (j <= 2147483457)) && (95 <= i))) || (((21 <= i) && (0 <= (j + 2147483648))) && (j <= 42))) || (((0 <= (j + 2147483648)) && (23 <= i)) && (j <= 46))) || (((0 <= (j + 2147483648)) && (j <= 2147483465)) && (99 <= i))) || (((0 <= (j + 2147483648)) && (j <= 66)) && (33 <= i))) || (((0 <= (j + 2147483648)) && (28 <= i)) && (j <= 56))) || (((0 <= (j + 2147483648)) && (j <= 18)) && (9 <= i))) || (((0 <= (j + 2147483648)) && (39 <= i)) && (j <= 78))) || (((0 <= (j + 2147483648)) && (j <= 2147483463)) && (98 <= i))) || (((0 <= (j + 2147483648)) && (48 <= i)) && (j <= 96))) || (((0 <= (j + 2147483648)) && (53 <= i)) && (j <= 106))) || (((0 <= (j + 2147483648)) && (20 <= i)) && (j <= 40))) || (((0 <= (j + 2147483648)) && (j <= 44)) && (22 <= i))) || (((0 <= (j + 2147483648)) && (j <= 112)) && (56 <= i))) || (((0 <= (j + 2147483648)) && (45 <= i)) && (j <= 90))) || (((79 <= i) && (0 <= (j + 2147483648))) && (j <= 158))) || (((0 <= (j + 2147483648)) && (58 <= i)) && (j <= 116))) || (((0 <= (j + 2147483648)) && (j <= 64)) && (32 <= i))) || (((0 <= (j + 2147483648)) && (74 <= i)) && (j <= 148))) || (((0 <= (j + 2147483648)) && (j <= 62)) && (31 <= i))) || (((0 <= (j + 2147483648)) && (j <= 50)) && (25 <= i))) || (((0 <= (j + 2147483648)) && (j <= 82)) && (41 <= i))) || (((0 <= (j + 2147483648)) && (57 <= i)) && (j <= 114))) || (((0 <= (j + 2147483648)) && (j <= 140)) && (70 <= i))) || (((j <= 54) && (0 <= (j + 2147483648))) && (27 <= i))) || (((0 <= (j + 2147483648)) && (43 <= i)) && (j <= 86))) || (((0 <= (j + 2147483648)) && (63 <= i)) && (j <= 126))) || (((0 <= (j + 2147483648)) && (13 <= i)) && (j <= 26))) || (((0 <= (j + 2147483648)) && (j <= 160)) && (80 <= i))) || (((0 <= (j + 2147483648)) && (49 <= i)) && (j <= 98))) || (((0 <= (j + 2147483648)) && (51 <= i)) && (j <= 102))) || (((0 <= (j + 2147483648)) && (j <= 142)) && (71 <= i))) || (((86 <= i) && (0 <= (j + 2147483648))) && (j <= 172))) || (((j <= 10) && (0 <= (j + 2147483648))) && (5 <= i))) || (((0 <= (j + 2147483648)) && (10 <= i)) && (j <= 20))) || (((0 <= (j + 2147483648)) && (j <= 32)) && (16 <= i))) || (((0 <= (j + 2147483648)) && (j <= 150)) && (75 <= i))) || (((0 <= (j + 2147483648)) && (88 <= i)) && (j <= 176))) || (((0 <= (j + 2147483648)) && (j <= 92)) && (46 <= i))) || (((0 <= (j + 2147483648)) && (j <= 22)) && (11 <= i))) || (((j <= 170) && (0 <= (j + 2147483648))) && (85 <= i))) || (((0 <= (j + 2147483648)) && (j <= 154)) && (77 <= i))) || (((0 <= (j + 2147483648)) && (37 <= i)) && (j <= 74))) || (((0 <= (j + 2147483648)) && (97 <= i)) && (j <= 2147483461))) || (((0 <= (j + 2147483648)) && (84 <= i)) && (j <= 168))) || (((0 <= (j + 2147483648)) && (j <= 48)) && (24 <= i))) || (((0 <= (j + 2147483648)) && (j <= 16)) && (8 <= i))) || (((0 <= (j + 2147483648)) && (j <= 38)) && (19 <= i))) || (((0 <= (j + 2147483648)) && (100 <= i)) && (j <= 2147483467))) || (((0 <= (j + 2147483648)) && (61 <= i)) && (j <= 122))) || (((0 <= (j + 2147483648)) && (j <= 188)) && (94 <= i))) || (((0 <= (j + 2147483648)) && (j <= 30)) && (15 <= i))) || (((0 <= (j + 2147483648)) && (12 <= i)) && (j <= 24))) || (((0 <= (j + 2147483648)) && (30 <= i)) && (j <= 60))) || (((0 <= (j + 2147483648)) && (j <= 108)) && (54 <= i))) || (((0 <= (j + 2147483648)) && (6 <= i)) && (j <= 12))) || (((0 <= (j + 2147483648)) && (j <= 136)) && (68 <= i))) || (((0 <= (j + 2147483648)) && (87 <= i)) && (j <= 174))) || (((0 <= (j + 2147483648)) && (26 <= i)) && (j <= 52))) || (((0 <= (j + 2147483648)) && (42 <= i)) && (j <= 84))) || (((0 <= (j + 2147483648)) && (50 <= i)) && (j <= 100))) || (((0 <= (j + 2147483648)) && (1 <= i)) && (j <= 2))) || (((j <= 104) && (0 <= (j + 2147483648))) && (52 <= i))) || (((0 <= (j + 2147483648)) && (40 <= i)) && (j <= 80))) || (((0 <= (j + 2147483648)) && (72 <= i)) && (j <= 144))) || (((0 <= (j + 2147483648)) && (17 <= i)) && (j <= 34))) || (((0 <= (j + 2147483648)) && (64 <= i)) && (j <= 128))) || (((0 <= (j + 2147483648)) && (7 <= i)) && (j <= 14))) || (((0 <= (j + 2147483648)) && (j <= 124)) && (62 <= i))) || (((55 <= i) && (0 <= (j + 2147483648))) && (j <= 110))) || (((0 <= (j + 2147483648)) && (47 <= i)) && (j <= 94))) || (((0 <= (j + 2147483648)) && (j <= 4)) && (2 <= i))) || (((0 <= (j + 2147483648)) && (38 <= i)) && (j <= 76))) || (((0 <= (j + 2147483648)) && (14 <= i)) && (j <= 28))) || (((j <= 120) && (0 <= (j + 2147483648))) && (60 <= i))) || (((0 <= (j + 2147483648)) && (18 <= i)) && (j <= 36))) || (((0 <= (j + 2147483648)) && (76 <= i)) && (j <= 152))) || (((j <= 72) && (0 <= (j + 2147483648))) && (36 <= i))) || (((0 <= (j + 2147483648)) && (i == 0)) && (j <= 0))) || (((0 <= (j + 2147483648)) && (92 <= i)) && (j <= 184))) || (((j <= 58) && (0 <= (j + 2147483648))) && (29 <= i))) || (((0 <= (j + 2147483648)) && (j <= 134)) && (67 <= i))) || (((0 <= (j + 2147483648)) && (j <= 166)) && (83 <= i))) || (((0 <= (j + 2147483648)) && (j <= 162)) && (81 <= i))) || (((0 <= (j + 2147483648)) && (j <= 156)) && (78 <= i))) || (((90 <= i) && (0 <= (j + 2147483648))) && (j <= 180))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:03:10,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE