./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Collatz_bounded.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/Collatz_bounded.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb8f212b8045dc9be8518316cbae752ce6111a4a93244dc89f86b0ea27a978ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:28:15,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:28:15,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:28:15,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:28:15,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:28:15,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:28:15,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:28:15,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:28:15,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:28:15,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:28:15,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:28:15,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:28:15,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:28:15,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:28:15,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:28:15,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:28:15,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:28:15,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:28:15,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:28:15,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:28:15,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:15,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:28:15,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:28:15,278 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:28:15,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:28:15,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:28:15,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:28:15,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:28:15,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:28:15,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:28:15,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:28:15,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8f212b8045dc9be8518316cbae752ce6111a4a93244dc89f86b0ea27a978ef [2025-03-04 10:28:15,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:28:15,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:28:15,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:28:15,518 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:28:15,518 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:28:15,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Collatz_bounded.c [2025-03-04 10:28:16,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f682594/12fb4cff553f4678a92be7428be22559/FLAGbc0dee6fd [2025-03-04 10:28:16,890 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:28:16,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Collatz_bounded.c [2025-03-04 10:28:16,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f682594/12fb4cff553f4678a92be7428be22559/FLAGbc0dee6fd [2025-03-04 10:28:17,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f682594/12fb4cff553f4678a92be7428be22559 [2025-03-04 10:28:17,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:28:17,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:28:17,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:17,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:28:17,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:28:17,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c2c8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17, skipping insertion in model container [2025-03-04 10:28:17,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:28:17,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:17,364 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:28:17,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:17,382 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:28:17,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17 WrapperNode [2025-03-04 10:28:17,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:17,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:17,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:28:17,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:28:17,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,403 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2025-03-04 10:28:17,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:17,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:28:17,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:28:17,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:28:17,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,413 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:28:17,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:28:17,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:28:17,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:28:17,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:28:17,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (1/1) ... [2025-03-04 10:28:17,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:17,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:17,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:28:17,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:28:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:28:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:28:17,499 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:28:17,501 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:28:17,602 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 10:28:17,603 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:28:17,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:28:17,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:28:17,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:17 BoogieIcfgContainer [2025-03-04 10:28:17,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:28:17,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:28:17,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:28:17,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:28:17,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:28:17" (1/3) ... [2025-03-04 10:28:17,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681bb472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:17, skipping insertion in model container [2025-03-04 10:28:17,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:17" (2/3) ... [2025-03-04 10:28:17,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681bb472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:17, skipping insertion in model container [2025-03-04 10:28:17,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:17" (3/3) ... [2025-03-04 10:28:17,618 INFO L128 eAbstractionObserver]: Analyzing ICFG Collatz_bounded.c [2025-03-04 10:28:17,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:28:17,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Collatz_bounded.c that has 1 procedures, 20 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-04 10:28:17,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:28:17,670 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;@37f43490, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:28:17,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:28:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:28:17,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:17,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:28:17,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:17,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1537351611, now seen corresponding path program 1 times [2025-03-04 10:28:17,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621272608] [2025-03-04 10:28:17,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:17,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:17,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:28:17,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:28:17,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:17,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621272608] [2025-03-04 10:28:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621272608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56593039] [2025-03-04 10:28:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:17,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:17,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:17,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:17,812 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:17,859 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-03-04 10:28:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:17,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:28:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:17,866 INFO L225 Difference]: With dead ends: 24 [2025-03-04 10:28:17,866 INFO L226 Difference]: Without dead ends: 15 [2025-03-04 10:28:17,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:17,870 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:17,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-04 10:28:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-04 10:28:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-04 10:28:17,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 6 [2025-03-04 10:28:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:17,889 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-04 10:28:17,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-03-04 10:28:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:28:17,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:17,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:17,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:28:17,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:17,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 413259666, now seen corresponding path program 1 times [2025-03-04 10:28:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:17,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980557174] [2025-03-04 10:28:17,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:28:17,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:28:17,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:17,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980557174] [2025-03-04 10:28:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980557174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:17,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542210910] [2025-03-04 10:28:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:17,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:17,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:17,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:17,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:17,918 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:17,955 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-04 10:28:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:17,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:28:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:17,956 INFO L225 Difference]: With dead ends: 25 [2025-03-04 10:28:17,956 INFO L226 Difference]: Without dead ends: 22 [2025-03-04 10:28:17,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:17,957 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:17,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-04 10:28:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-04 10:28:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-04 10:28:17,962 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 7 [2025-03-04 10:28:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-04 10:28:17,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-04 10:28:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:28:17,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:17,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:17,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:28:17,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:17,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1110286099, now seen corresponding path program 1 times [2025-03-04 10:28:17,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:17,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656889708] [2025-03-04 10:28:17,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:17,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:28:17,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:28:17,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:17,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656889708] [2025-03-04 10:28:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656889708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849828875] [2025-03-04 10:28:18,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:18,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:18,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:18,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:28:18,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:28:18,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:28:18,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:18,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:18,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:28:18,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849828875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:18,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:28:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28979919] [2025-03-04 10:28:18,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:18,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:18,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:18,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:18,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:18,109 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:18,197 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2025-03-04 10:28:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:28:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 13 [2025-03-04 10:28:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:18,198 INFO L225 Difference]: With dead ends: 46 [2025-03-04 10:28:18,199 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 10:28:18,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:18,200 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:18,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 10:28:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 10:28:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-04 10:28:18,205 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2025-03-04 10:28:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:18,205 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-04 10:28:18,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-04 10:28:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:28:18,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:18,207 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 10:28:18,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:28:18,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:18,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:18,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash 165583742, now seen corresponding path program 2 times [2025-03-04 10:28:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:18,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95681414] [2025-03-04 10:28:18,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:18,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:28:18,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:28:18,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:18,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95681414] [2025-03-04 10:28:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95681414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150043896] [2025-03-04 10:28:18,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:18,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:18,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:18,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:18,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:28:18,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 10:28:18,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:28:18,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:18,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:28:18,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150043896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:18,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:28:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907831838] [2025-03-04 10:28:18,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:18,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:28:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:28:18,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:18,743 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:18,873 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2025-03-04 10:28:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:28:18,874 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 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 31 [2025-03-04 10:28:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:18,875 INFO L225 Difference]: With dead ends: 93 [2025-03-04 10:28:18,875 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 10:28:18,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:18,876 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:18,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 10:28:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2025-03-04 10:28:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 84 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2025-03-04 10:28:18,882 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 31 [2025-03-04 10:28:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:18,882 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2025-03-04 10:28:18,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2025-03-04 10:28:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:28:18,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:18,883 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1] [2025-03-04 10:28:18,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:19,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:28:19,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:19,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:19,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1370924182, now seen corresponding path program 3 times [2025-03-04 10:28:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:19,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633074440] [2025-03-04 10:28:19,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:19,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 9 equivalence classes. [2025-03-04 10:28:19,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 55 statements. [2025-03-04 10:28:19,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:28:19,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-04 10:28:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633074440] [2025-03-04 10:28:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633074440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:19,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008468790] [2025-03-04 10:28:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:19,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:19,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:19,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:19,287 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:19,337 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2025-03-04 10:28:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:28:19,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-04 10:28:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:19,338 INFO L225 Difference]: With dead ends: 189 [2025-03-04 10:28:19,338 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 10:28:19,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:19,339 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:19,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 8 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 10:28:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2025-03-04 10:28:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.121212121212121) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2025-03-04 10:28:19,358 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 55 [2025-03-04 10:28:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:19,358 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2025-03-04 10:28:19,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2025-03-04 10:28:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 10:28:19,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:19,360 INFO L218 NwaCegarLoop]: trace histogram [18, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1] [2025-03-04 10:28:19,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:28:19,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:19,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1853663772, now seen corresponding path program 1 times [2025-03-04 10:28:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:19,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430597184] [2025-03-04 10:28:19,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:19,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 10:28:19,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 10:28:19,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:19,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-04 10:28:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430597184] [2025-03-04 10:28:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430597184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602074816] [2025-03-04 10:28:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:19,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:19,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:19,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:19,600 INFO L87 Difference]: Start difference. First operand 101 states and 111 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-04 10:28:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:19,642 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2025-03-04 10:28:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:28:19,643 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 93 [2025-03-04 10:28:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:19,643 INFO L225 Difference]: With dead ends: 102 [2025-03-04 10:28:19,643 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:28:19,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:28:19,646 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:19,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:28:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 10:28:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-04 10:28:19,662 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 93 [2025-03-04 10:28:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:19,663 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-04 10:28:19,663 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-04 10:28:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-04 10:28:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:28:19,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:19,666 INFO L218 NwaCegarLoop]: trace histogram [19, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2025-03-04 10:28:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:28:19,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:19,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash -766008223, now seen corresponding path program 1 times [2025-03-04 10:28:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022752419] [2025-03-04 10:28:19,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:19,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:28:19,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:28:19,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:19,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 17 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:21,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:21,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022752419] [2025-03-04 10:28:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022752419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:21,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110813728] [2025-03-04 10:28:21,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:21,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:21,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:21,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:21,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:28:21,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:28:21,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:28:21,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:21,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:21,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 10:28:21,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 17 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:21,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 34 proven. 542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110813728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:22,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29, 20] total 76 [2025-03-04 10:28:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805831470] [2025-03-04 10:28:22,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:22,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-04 10:28:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-04 10:28:22,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2473, Invalid=3379, Unknown=0, NotChecked=0, Total=5852 [2025-03-04 10:28:22,508 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 77 states, 76 states have (on average 3.5) internal successors, (266), 77 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:23,247 INFO L93 Difference]: Finished difference Result 885 states and 1009 transitions. [2025-03-04 10:28:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 10:28:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 3.5) internal successors, (266), 77 states have internal predecessors, (266), 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 97 [2025-03-04 10:28:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:23,252 INFO L225 Difference]: With dead ends: 885 [2025-03-04 10:28:23,252 INFO L226 Difference]: Without dead ends: 884 [2025-03-04 10:28:23,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4484 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3173, Invalid=4309, Unknown=0, NotChecked=0, Total=7482 [2025-03-04 10:28:23,256 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 258 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:23,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 9 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:28:23,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-04 10:28:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 258. [2025-03-04 10:28:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.132295719844358) internal successors, (291), 257 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 291 transitions. [2025-03-04 10:28:23,285 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 291 transitions. Word has length 97 [2025-03-04 10:28:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 291 transitions. [2025-03-04 10:28:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 3.5) internal successors, (266), 77 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 291 transitions. [2025-03-04 10:28:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-04 10:28:23,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:23,287 INFO L218 NwaCegarLoop]: trace histogram [41, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1] [2025-03-04 10:28:23,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:28:23,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:23,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:23,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:23,488 INFO L85 PathProgramCache]: Analyzing trace with hash 329258718, now seen corresponding path program 2 times [2025-03-04 10:28:23,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:23,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666050942] [2025-03-04 10:28:23,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:23,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 207 statements into 2 equivalence classes. [2025-03-04 10:28:23,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-03-04 10:28:23,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:23,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 39 proven. 2781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:27,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:27,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666050942] [2025-03-04 10:28:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666050942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:27,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733998564] [2025-03-04 10:28:27,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:27,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:27,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:28:27,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 207 statements into 2 equivalence classes. [2025-03-04 10:28:27,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 207 of 207 statements. [2025-03-04 10:28:27,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:27,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:27,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-04 10:28:27,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 39 proven. 2781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:29,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 78 proven. 2742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:30,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733998564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:30,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:30,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 62, 42] total 169 [2025-03-04 10:28:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891605784] [2025-03-04 10:28:30,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:30,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 170 states [2025-03-04 10:28:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:30,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2025-03-04 10:28:30,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11349, Invalid=17381, Unknown=0, NotChecked=0, Total=28730 [2025-03-04 10:28:30,549 INFO L87 Difference]: Start difference. First operand 258 states and 291 transitions. Second operand has 170 states, 169 states have (on average 3.526627218934911) internal successors, (596), 170 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:33,697 INFO L93 Difference]: Finished difference Result 6157 states and 6965 transitions. [2025-03-04 10:28:33,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2025-03-04 10:28:33,698 INFO L78 Accepts]: Start accepts. Automaton has has 170 states, 169 states have (on average 3.526627218934911) internal successors, (596), 170 states have internal predecessors, (596), 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 207 [2025-03-04 10:28:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:33,717 INFO L225 Difference]: With dead ends: 6157 [2025-03-04 10:28:33,717 INFO L226 Difference]: Without dead ends: 6156 [2025-03-04 10:28:33,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 312 SyntacticMatches, 14 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30575 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=19974, Invalid=32696, Unknown=0, NotChecked=0, Total=52670 [2025-03-04 10:28:33,725 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 696 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:33,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 8 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:28:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6156 states. [2025-03-04 10:28:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 484. [2025-03-04 10:28:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.1221532091097308) internal successors, (542), 483 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 542 transitions. [2025-03-04 10:28:33,794 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 542 transitions. Word has length 207 [2025-03-04 10:28:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:33,795 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 542 transitions. [2025-03-04 10:28:33,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 170 states, 169 states have (on average 3.526627218934911) internal successors, (596), 170 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 542 transitions. [2025-03-04 10:28:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-04 10:28:33,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:33,798 INFO L218 NwaCegarLoop]: trace histogram [45, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1] [2025-03-04 10:28:33,804 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-04 10:28:33,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:33,999 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:28:33,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1754375756, now seen corresponding path program 3 times [2025-03-04 10:28:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:33,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006464063] [2025-03-04 10:28:33,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:34,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 227 statements into 30 equivalence classes. [2025-03-04 10:28:34,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) and asserted 227 of 227 statements. [2025-03-04 10:28:34,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2025-03-04 10:28:34,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:29:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 0 proven. 3410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:29:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006464063] [2025-03-04 10:29:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006464063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:29:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809149029] [2025-03-04 10:29:06,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:29:06,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:29:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:29:06,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:29:06,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:29:06,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 227 statements into 30 equivalence classes.