./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Cairo_step2-2.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/Cairo_step2-2.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 76fcbcb67039c0a78cfe1723cb1895d2882967fdc056ee8f9638db41d873b34f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:28:13,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:28:13,792 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:13,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:28:13,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:28:13,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:28:13,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:28:13,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:28:13,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:28:13,818 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:28:13,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:28:13,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:28:13,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:28:13,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:28:13,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:28:13,820 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:13,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:28:13,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:28:13,820 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 -> 76fcbcb67039c0a78cfe1723cb1895d2882967fdc056ee8f9638db41d873b34f [2025-03-04 10:28:14,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:28:14,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:28:14,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:28:14,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:28:14,081 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:28:14,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Cairo_step2-2.c [2025-03-04 10:28:15,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d913c2d/9859bdf70278457a870c9eb54ea9e315/FLAG93f0adbcd [2025-03-04 10:28:15,393 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:28:15,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Cairo_step2-2.c [2025-03-04 10:28:15,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d913c2d/9859bdf70278457a870c9eb54ea9e315/FLAG93f0adbcd [2025-03-04 10:28:15,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d913c2d/9859bdf70278457a870c9eb54ea9e315 [2025-03-04 10:28:15,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:28:15,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:28:15,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:15,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:28:15,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:28:15,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:15" (1/1) ... [2025-03-04 10:28:15,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:15, skipping insertion in model container [2025-03-04 10:28:15,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:15" (1/1) ... [2025-03-04 10:28:15,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:28:15,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:15,564 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:28:15,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:15,581 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:28:15,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:15 WrapperNode [2025-03-04 10:28:15,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:15,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:15,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:28:15,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:28:15,587 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:15" (1/1) ... [2025-03-04 10:28:15,590 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:15" (1/1) ... [2025-03-04 10:28:15,601 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2025-03-04 10:28:15,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:15,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:28:15,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:28:15,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:28:15,607 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:15" (1/1) ... [2025-03-04 10:28:15,608 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:15" (1/1) ... [2025-03-04 10:28:15,608 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:15" (1/1) ... [2025-03-04 10:28:15,612 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:28:15,612 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:15" (1/1) ... [2025-03-04 10:28:15,612 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:15" (1/1) ... [2025-03-04 10:28:15,613 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:15" (1/1) ... [2025-03-04 10:28:15,615 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:15" (1/1) ... [2025-03-04 10:28:15,615 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:15" (1/1) ... [2025-03-04 10:28:15,616 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:15" (1/1) ... [2025-03-04 10:28:15,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:28:15,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:28:15,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:28:15,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:28:15,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:15" (1/1) ... [2025-03-04 10:28:15,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:15,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:15,649 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:15,656 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:15,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:28:15,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:28:15,717 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:28:15,718 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:28:15,776 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-04 10:28:15,776 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:28:15,782 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:28:15,782 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:28:15,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:15 BoogieIcfgContainer [2025-03-04 10:28:15,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:28:15,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:28:15,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:28:15,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:28:15,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:28:15" (1/3) ... [2025-03-04 10:28:15,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:15, skipping insertion in model container [2025-03-04 10:28:15,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:15" (2/3) ... [2025-03-04 10:28:15,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:15, skipping insertion in model container [2025-03-04 10:28:15,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:15" (3/3) ... [2025-03-04 10:28:15,792 INFO L128 eAbstractionObserver]: Analyzing ICFG Cairo_step2-2.c [2025-03-04 10:28:15,805 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:28:15,807 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Cairo_step2-2.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-04 10:28:15,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:28:15,860 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;@415ec119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:28:15,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 10:28:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:28:15,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:15,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:28:15,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:15,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:15,873 INFO L85 PathProgramCache]: Analyzing trace with hash 40047976, now seen corresponding path program 1 times [2025-03-04 10:28:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054247359] [2025-03-04 10:28:15,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:15,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:28:15,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:28:15,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:15,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:15,998 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:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054247359] [2025-03-04 10:28:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054247359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:16,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398005051] [2025-03-04 10:28:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:16,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:16,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:16,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:16,024 INFO L87 Difference]: Start difference. First operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:16,060 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-03-04 10:28:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:16,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:28:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:16,066 INFO L225 Difference]: With dead ends: 20 [2025-03-04 10:28:16,066 INFO L226 Difference]: Without dead ends: 11 [2025-03-04 10:28:16,068 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:16,070 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:16,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-04 10:28:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2025-03-04 10:28:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-04 10:28:16,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2025-03-04 10:28:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:16,098 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-04 10:28:16,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-04 10:28:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:28:16,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:16,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:28:16,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:28:16,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:16,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:16,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1241487229, now seen corresponding path program 1 times [2025-03-04 10:28:16,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:16,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815492872] [2025-03-04 10:28:16,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:16,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:28:16,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:28:16,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:16,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:16,139 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:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815492872] [2025-03-04 10:28:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815492872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585091137] [2025-03-04 10:28:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:16,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:16,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:16,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:16,144 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:16,158 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2025-03-04 10:28:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:16,158 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:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:16,159 INFO L225 Difference]: With dead ends: 10 [2025-03-04 10:28:16,159 INFO L226 Difference]: Without dead ends: 9 [2025-03-04 10:28:16,159 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:16,160 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:16,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-04 10:28:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-04 10:28:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-04 10:28:16,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2025-03-04 10:28:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:16,164 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-04 10:28:16,164 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:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-04 10:28:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:28:16,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:16,165 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:16,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:28:16,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:16,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash -931681957, now seen corresponding path program 1 times [2025-03-04 10:28:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364967968] [2025-03-04 10:28:16,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:16,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:28:16,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:28:16,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:16,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:16,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364967968] [2025-03-04 10:28:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364967968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433062978] [2025-03-04 10:28:16,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:16,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:16,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:16,234 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:16,235 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:16,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:28:16,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:28:16,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:16,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:16,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:28:16,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:16,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433062978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:16,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:28:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173518809] [2025-03-04 10:28:16,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:16,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:16,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:16,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:16,354 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:16,388 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-04 10:28:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:28:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:28:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:16,389 INFO L225 Difference]: With dead ends: 19 [2025-03-04 10:28:16,389 INFO L226 Difference]: Without dead ends: 18 [2025-03-04 10:28:16,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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:16,389 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:16,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-04 10:28:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-04 10:28:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 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:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-04 10:28:16,396 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-04 10:28:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:16,396 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-04 10:28:16,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-04 10:28:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:28:16,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:16,396 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-04 10:28:16,402 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:16,600 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:16,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -857707608, now seen corresponding path program 2 times [2025-03-04 10:28:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838922308] [2025-03-04 10:28:16,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:16,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:28:16,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:28:16,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:16,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:16,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:16,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838922308] [2025-03-04 10:28:16,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838922308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:16,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633965492] [2025-03-04 10:28:16,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:16,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:16,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:16,722 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:16,724 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:16,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:28:16,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:28:16,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:16,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:16,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:28:16,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:16,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633965492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:16,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:28:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93439835] [2025-03-04 10:28:16,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:16,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:28:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:16,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:28:16,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:16,874 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:16,927 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-04 10:28:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:28:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 17 [2025-03-04 10:28:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:16,927 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:28:16,927 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:28:16,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:16,928 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:16,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:28:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:28:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 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:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-03-04 10:28:16,933 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 17 [2025-03-04 10:28:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:16,933 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-03-04 10:28:16,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-03-04 10:28:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:28:16,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:16,934 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2025-03-04 10:28:16,939 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:17,136 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:17,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:17,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 335845640, now seen corresponding path program 3 times [2025-03-04 10:28:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933316174] [2025-03-04 10:28:17,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:17,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-03-04 10:28:17,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:28:17,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:28:17,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933316174] [2025-03-04 10:28:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933316174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604670438] [2025-03-04 10:28:17,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:17,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:17,383 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:17,385 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:17,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 11 equivalence classes. [2025-03-04 10:28:17,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:28:17,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:28:17,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:17,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:28:17,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:17,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604670438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:17,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:17,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 10:28:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003994666] [2025-03-04 10:28:17,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:17,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:28:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:17,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:28:17,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:28:17,698 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 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,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:17,778 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2025-03-04 10:28:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:28:17,778 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 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 35 [2025-03-04 10:28:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:17,779 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:28:17,779 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:28:17,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:28:17,780 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:17,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:28:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 10:28:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 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,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2025-03-04 10:28:17,785 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 35 [2025-03-04 10:28:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:17,785 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2025-03-04 10:28:17,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 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,785 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2025-03-04 10:28:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 10:28:17,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:17,786 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2025-03-04 10:28:17,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:17,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:17,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:17,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -780325944, now seen corresponding path program 4 times [2025-03-04 10:28:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:17,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216612585] [2025-03-04 10:28:17,987 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:17,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:17,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-03-04 10:28:18,007 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:28:18,007 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216612585] [2025-03-04 10:28:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216612585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:18,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310513280] [2025-03-04 10:28:18,456 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:18,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:18,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:18,459 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:18,459 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:18,479 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 71 statements into 2 equivalence classes. [2025-03-04 10:28:18,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:28:18,493 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:18,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:18,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:28:18,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:18,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:19,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310513280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:19,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:19,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 10:28:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936428971] [2025-03-04 10:28:19,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:19,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 10:28:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:19,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 10:28:19,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:28:19,293 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 48 states have internal predecessors, (140), 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,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:19,466 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2025-03-04 10:28:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:28:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 48 states have internal predecessors, (140), 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 71 [2025-03-04 10:28:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:19,467 INFO L225 Difference]: With dead ends: 145 [2025-03-04 10:28:19,467 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 10:28:19,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:28:19,469 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:19,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 10:28:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 10:28:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.006993006993007) internal successors, (144), 143 states have internal predecessors, (144), 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,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2025-03-04 10:28:19,482 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 71 [2025-03-04 10:28:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:19,483 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2025-03-04 10:28:19,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 48 states have internal predecessors, (140), 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,483 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2025-03-04 10:28:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 10:28:19,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:19,486 INFO L218 NwaCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2025-03-04 10:28:19,492 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:19,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:19,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:19,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1080610488, now seen corresponding path program 5 times [2025-03-04 10:28:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107364030] [2025-03-04 10:28:19,691 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:28:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:19,699 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 143 statements into 47 equivalence classes. [2025-03-04 10:28:19,739 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 10:28:19,739 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 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,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107364030] [2025-03-04 10:28:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107364030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332922633] [2025-03-04 10:28:21,398 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:28:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:21,402 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:28:21,403 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:28:21,427 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 143 statements into 47 equivalence classes. [2025-03-04 10:28:21,485 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 10:28:21,485 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:28:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:21,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:28:21,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:21,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332922633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:23,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-04 10:28:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446614428] [2025-03-04 10:28:23,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:23,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 10:28:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:23,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 10:28:23,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:28:23,734 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand has 96 states, 95 states have (on average 2.9894736842105263) internal successors, (284), 96 states have internal predecessors, (284), 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:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:24,093 INFO L93 Difference]: Finished difference Result 289 states and 336 transitions. [2025-03-04 10:28:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 10:28:24,094 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 2.9894736842105263) internal successors, (284), 96 states have internal predecessors, (284), 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 143 [2025-03-04 10:28:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:24,095 INFO L225 Difference]: With dead ends: 289 [2025-03-04 10:28:24,095 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 10:28:24,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:28:24,097 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:24,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:28:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 10:28:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-03-04 10:28:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.0034843205574913) internal successors, (288), 287 states have internal predecessors, (288), 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:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2025-03-04 10:28:24,112 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 143 [2025-03-04 10:28:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:24,112 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2025-03-04 10:28:24,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 2.9894736842105263) internal successors, (284), 96 states have internal predecessors, (284), 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:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2025-03-04 10:28:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 10:28:24,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:24,117 INFO L218 NwaCegarLoop]: trace histogram [95, 94, 94, 1, 1, 1, 1] [2025-03-04 10:28:24,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:24,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:24,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:24,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1347503032, now seen corresponding path program 6 times [2025-03-04 10:28:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:24,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349754646] [2025-03-04 10:28:24,318 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:28:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:24,326 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 287 statements into 95 equivalence classes. [2025-03-04 10:28:24,384 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 10:28:24,384 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:28:24,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349754646] [2025-03-04 10:28:28,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349754646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148766492] [2025-03-04 10:28:28,664 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:28:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:28,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:28,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:28,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:28:28,695 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 287 statements into 95 equivalence classes. [2025-03-04 10:28:28,851 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 10:28:28,851 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:28:28,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:28,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 10:28:28,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:29,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148766492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:36,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:36,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-04 10:28:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972946874] [2025-03-04 10:28:36,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:36,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 10:28:36,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:36,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 10:28:36,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 10:28:36,725 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand has 192 states, 191 states have (on average 2.994764397905759) internal successors, (572), 192 states have internal predecessors, (572), 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:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:37,466 INFO L93 Difference]: Finished difference Result 577 states and 672 transitions. [2025-03-04 10:28:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-04 10:28:37,466 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 2.994764397905759) internal successors, (572), 192 states have internal predecessors, (572), 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 287 [2025-03-04 10:28:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:37,469 INFO L225 Difference]: With dead ends: 577 [2025-03-04 10:28:37,469 INFO L226 Difference]: Without dead ends: 576 [2025-03-04 10:28:37,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 477 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 10:28:37,471 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:37,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:28:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-04 10:28:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2025-03-04 10:28:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 1.0017391304347827) internal successors, (576), 575 states have internal predecessors, (576), 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:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 576 transitions. [2025-03-04 10:28:37,495 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 576 transitions. Word has length 287 [2025-03-04 10:28:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:37,496 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 576 transitions. [2025-03-04 10:28:37,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 2.994764397905759) internal successors, (572), 192 states have internal predecessors, (572), 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:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 576 transitions. [2025-03-04 10:28:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-04 10:28:37,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:37,503 INFO L218 NwaCegarLoop]: trace histogram [191, 190, 190, 1, 1, 1, 1] [2025-03-04 10:28:37,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:28:37,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:37,703 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:37,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1500238408, now seen corresponding path program 7 times [2025-03-04 10:28:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:37,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478610960] [2025-03-04 10:28:37,704 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:28:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:37,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-04 10:28:37,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-04 10:28:37,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:37,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 54245 backedges. 0 proven. 54245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:53,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:53,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478610960] [2025-03-04 10:28:53,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478610960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:53,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410988497] [2025-03-04 10:28:53,245 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:28:53,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:53,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:53,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:53,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:28:53,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-04 10:28:53,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-04 10:28:53,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:53,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:53,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-04 10:28:53,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 54245 backedges. 0 proven. 54245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:53,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:29:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 54245 backedges. 0 proven. 54245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410988497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:29:23,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:29:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-03-04 10:29:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523609468] [2025-03-04 10:29:23,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:29:23,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-04 10:29:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:29:23,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-04 10:29:23,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-04 10:29:23,772 INFO L87 Difference]: Start difference. First operand 576 states and 576 transitions. Second operand has 384 states, 383 states have (on average 2.9973890339425586) internal successors, (1148), 384 states have internal predecessors, (1148), 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:29:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:29:28,647 INFO L93 Difference]: Finished difference Result 1153 states and 1344 transitions. [2025-03-04 10:29:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-03-04 10:29:28,648 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 2.9973890339425586) internal successors, (1148), 384 states have internal predecessors, (1148), 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 575 [2025-03-04 10:29:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:29:28,652 INFO L225 Difference]: With dead ends: 1153 [2025-03-04 10:29:28,652 INFO L226 Difference]: Without dead ends: 1152 [2025-03-04 10:29:28,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1340 GetRequests, 957 SyntacticMatches, 1 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-04 10:29:28,657 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:29:28,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:29:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-04 10:29:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2025-03-04 10:29:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.000868809730669) internal successors, (1152), 1151 states have internal predecessors, (1152), 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:29:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1152 transitions. [2025-03-04 10:29:28,683 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1152 transitions. Word has length 575 [2025-03-04 10:29:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:29:28,683 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1152 transitions. [2025-03-04 10:29:28,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 2.9973890339425586) internal successors, (1148), 384 states have internal predecessors, (1148), 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:29:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1152 transitions. [2025-03-04 10:29:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1152 [2025-03-04 10:29:28,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:29:28,691 INFO L218 NwaCegarLoop]: trace histogram [383, 382, 382, 1, 1, 1, 1] [2025-03-04 10:29:28,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:29:28,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:29:28,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:29:28,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:29:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1558315448, now seen corresponding path program 8 times [2025-03-04 10:29:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:29:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372238503] [2025-03-04 10:29:28,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:29:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:29:28,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1151 statements into 2 equivalence classes. [2025-03-04 10:29:29,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1151 of 1151 statements. [2025-03-04 10:29:29,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:29:29,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat