./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a9444e5380fed44b00432b26b7edd9414dfa93ba2d2f76306ea753732eae2b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:01:01,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:01:01,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:01:01,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:01:01,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:01:01,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:01:01,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:01:01,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:01:01,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:01:01,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:01:01,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:01:01,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:01:01,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:01:01,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:01:01,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:01:01,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:01:01,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:01:01,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:01:01,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:01:01,781 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a9444e5380fed44b00432b26b7edd9414dfa93ba2d2f76306ea753732eae2b3 [2025-03-17 15:01:02,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:01:02,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:01:02,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:01:02,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:01:02,026 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:01:02,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i [2025-03-17 15:01:03,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed791174d/b070050daf40479896c290d72f2b3e94/FLAGe0b379624 [2025-03-17 15:01:03,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:01:03,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i [2025-03-17 15:01:03,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed791174d/b070050daf40479896c290d72f2b3e94/FLAGe0b379624 [2025-03-17 15:01:03,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed791174d/b070050daf40479896c290d72f2b3e94 [2025-03-17 15:01:03,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:01:03,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:01:03,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:01:03,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:01:03,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:01:03,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8a2b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03, skipping insertion in model container [2025-03-17 15:01:03,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:01:03,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:01:03,629 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:01:03,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:01:03,650 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:01:03,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03 WrapperNode [2025-03-17 15:01:03,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:01:03,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:01:03,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:01:03,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:01:03,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,675 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 36 [2025-03-17 15:01:03,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:01:03,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:01:03,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:01:03,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:01:03,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,691 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:01:03,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:01:03,695 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:01:03,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:01:03,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:01:03,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (1/1) ... [2025-03-17 15:01:03,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:01:03,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:01:03,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:01:03,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:01:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:01:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:01:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:01:03,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:01:03,777 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:01:03,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:01:03,877 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 15:01:03,877 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:01:03,887 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:01:03,887 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:01:03,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:03 BoogieIcfgContainer [2025-03-17 15:01:03,887 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:01:03,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:01:03,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:01:03,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:01:03,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:01:03" (1/3) ... [2025-03-17 15:01:03,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70286a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:03, skipping insertion in model container [2025-03-17 15:01:03,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:01:03" (2/3) ... [2025-03-17 15:01:03,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70286a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:01:03, skipping insertion in model container [2025-03-17 15:01:03,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:01:03" (3/3) ... [2025-03-17 15:01:03,897 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.i [2025-03-17 15:01:03,908 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:01:03,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark10_conjunctive.i that has 1 procedures, 20 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-17 15:01:03,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:01:03,961 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;@45a2af02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:01:03,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 15:01:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 15:01:03,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:03,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 15:01:03,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:03,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1661215, now seen corresponding path program 1 times [2025-03-17 15:01:03,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:03,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62341264] [2025-03-17 15:01:03,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:04,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 15:01:04,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 15:01:04,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:04,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62341264] [2025-03-17 15:01:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62341264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:01:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:01:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:01:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935794622] [2025-03-17 15:01:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:01:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:01:04,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:04,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:01:04,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,137 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:04,173 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2025-03-17 15:01:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:01:04,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 15:01:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:04,181 INFO L225 Difference]: With dead ends: 28 [2025-03-17 15:01:04,182 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 15:01:04,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,185 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:04,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:01:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 15:01:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-17 15:01:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-17 15:01:04,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2025-03-17 15:01:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-17 15:01:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-17 15:01:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:01:04,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:04,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:01:04,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:01:04,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:04,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:04,211 INFO L85 PathProgramCache]: Analyzing trace with hash 51497650, now seen corresponding path program 1 times [2025-03-17 15:01:04,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:04,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868714540] [2025-03-17 15:01:04,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:04,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:04,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:01:04,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:01:04,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:04,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868714540] [2025-03-17 15:01:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868714540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:01:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:01:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:01:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992934076] [2025-03-17 15:01:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:01:04,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:01:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:04,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:01:04,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,250 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:04,273 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-03-17 15:01:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:01:04,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:01:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:04,274 INFO L225 Difference]: With dead ends: 16 [2025-03-17 15:01:04,274 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 15:01:04,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,276 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:04,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:01:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 15:01:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-17 15:01:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-17 15:01:04,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2025-03-17 15:01:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:04,281 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-17 15:01:04,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-17 15:01:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:01:04,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:04,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:01:04,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:01:04,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:04,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1596427133, now seen corresponding path program 1 times [2025-03-17 15:01:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629307429] [2025-03-17 15:01:04,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:04,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:01:04,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:01:04,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:04,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629307429] [2025-03-17 15:01:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629307429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:01:04,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:01:04,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:01:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243675059] [2025-03-17 15:01:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:01:04,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:01:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:04,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:01:04,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,319 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:04,333 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-17 15:01:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:01:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:01:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:04,334 INFO L225 Difference]: With dead ends: 15 [2025-03-17 15:01:04,334 INFO L226 Difference]: Without dead ends: 14 [2025-03-17 15:01:04,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,335 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:04,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:01:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-17 15:01:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 15:01:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-17 15:01:04,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2025-03-17 15:01:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:04,339 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-17 15:01:04,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-17 15:01:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:01:04,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:04,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:01:04,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:01:04,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:04,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2050366448, now seen corresponding path program 1 times [2025-03-17 15:01:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087615191] [2025-03-17 15:01:04,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:04,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:01:04,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:01:04,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:04,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:04,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087615191] [2025-03-17 15:01:04,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087615191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:01:04,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:01:04,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:01:04,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045692680] [2025-03-17 15:01:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:01:04,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:01:04,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:04,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:01:04,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,366 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:04,381 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-03-17 15:01:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:01:04,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:01:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:04,382 INFO L225 Difference]: With dead ends: 17 [2025-03-17 15:01:04,382 INFO L226 Difference]: Without dead ends: 16 [2025-03-17 15:01:04,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:04,383 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:04,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:01:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-17 15:01:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 15:01:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-17 15:01:04,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2025-03-17 15:01:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:04,385 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-17 15:01:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-17 15:01:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:01:04,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:04,385 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:01:04,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:01:04,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:04,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 558011770, now seen corresponding path program 1 times [2025-03-17 15:01:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195096066] [2025-03-17 15:01:04,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:04,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:01:04,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:01:04,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195096066] [2025-03-17 15:01:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195096066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:01:04,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:01:04,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:01:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674904069] [2025-03-17 15:01:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:01:04,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:01:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:04,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:01:04,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:01:04,458 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:04,508 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-03-17 15:01:04,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:01:04,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 15:01:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:04,509 INFO L225 Difference]: With dead ends: 16 [2025-03-17 15:01:04,509 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 15:01:04,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:01:04,510 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:04,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:01:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 15:01:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-17 15:01:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-17 15:01:04,513 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2025-03-17 15:01:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:04,513 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-17 15:01:04,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-17 15:01:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 15:01:04,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:04,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:01:04,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:01:04,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:04,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash 118495671, now seen corresponding path program 1 times [2025-03-17 15:01:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:04,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444433347] [2025-03-17 15:01:04,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:04,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:01:04,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:01:04,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:04,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444433347] [2025-03-17 15:01:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444433347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:01:04,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209059900] [2025-03-17 15:01:04,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:04,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:04,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:01:04,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:01:04,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:01:04,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:01:04,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:01:04,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:04,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:04,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:01:04,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:01:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:01:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209059900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:01:04,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:01:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-17 15:01:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765517820] [2025-03-17 15:01:04,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:01:04,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:01:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:04,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:01:04,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:01:04,756 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:04,826 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-03-17 15:01:04,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:01:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 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 11 [2025-03-17 15:01:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:04,826 INFO L225 Difference]: With dead ends: 27 [2025-03-17 15:01:04,827 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 15:01:04,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:01:04,827 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:04,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:01:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 15:01:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-17 15:01:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2025-03-17 15:01:04,832 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 11 [2025-03-17 15:01:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2025-03-17 15:01:04,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2025-03-17 15:01:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:01:04,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:04,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:01:04,841 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-17 15:01:05,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 15:01:05,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:05,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2089777707, now seen corresponding path program 1 times [2025-03-17 15:01:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916328509] [2025-03-17 15:01:05,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:01:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:05,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:01:05,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:01:05,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:01:05,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:01:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916328509] [2025-03-17 15:01:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916328509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:01:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:01:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:01:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022997690] [2025-03-17 15:01:05,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:01:05,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:01:05,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:05,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:01:05,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:05,059 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:05,070 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-17 15:01:05,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:01:05,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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) Word has length 13 [2025-03-17 15:01:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:05,071 INFO L225 Difference]: With dead ends: 25 [2025-03-17 15:01:05,071 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 15:01:05,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:01:05,072 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:05,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:01:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 15:01:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 15:01:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-17 15:01:05,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2025-03-17 15:01:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:05,078 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-17 15:01:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-17 15:01:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 15:01:05,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:05,079 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1] [2025-03-17 15:01:05,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:01:05,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:05,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1209712511, now seen corresponding path program 2 times [2025-03-17 15:01:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647254794] [2025-03-17 15:01:05,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:01:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:05,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 15:01:05,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:01:05,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:01:05,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647254794] [2025-03-17 15:01:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647254794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:01:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73510947] [2025-03-17 15:01:05,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:01:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:01:05,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:01:05,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:01:05,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-17 15:01:05,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:01:05,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:01:05,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:05,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:01:05,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:01:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:05,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:01:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73510947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:01:05,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:01:05,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-17 15:01:05,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564180224] [2025-03-17 15:01:05,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:01:05,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:01:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:05,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:01:05,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:01:05,510 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:05,802 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2025-03-17 15:01:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 15:01:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 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 23 [2025-03-17 15:01:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:05,803 INFO L225 Difference]: With dead ends: 49 [2025-03-17 15:01:05,803 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 15:01:05,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=413, Invalid=919, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 15:01:05,804 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:05,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 7 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:01:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 15:01:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 15:01:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2025-03-17 15:01:05,809 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 23 [2025-03-17 15:01:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:05,809 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2025-03-17 15:01:05,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2025-03-17 15:01:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 15:01:05,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:05,810 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1] [2025-03-17 15:01:05,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:01:06,010 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,SelfDestructingSolverStorable7 [2025-03-17 15:01:06,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:06,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:06,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1292603115, now seen corresponding path program 3 times [2025-03-17 15:01:06,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447532244] [2025-03-17 15:01:06,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:01:06,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:06,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 8 equivalence classes. [2025-03-17 15:01:06,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 15:01:06,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 15:01:06,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:06,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:06,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447532244] [2025-03-17 15:01:06,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447532244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:01:06,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893428130] [2025-03-17 15:01:06,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:01:06,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:01:06,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:01:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:01:06,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 8 equivalence classes. [2025-03-17 15:01:06,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 15:01:06,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 15:01:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:06,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 15:01:06,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:01:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:06,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:01:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893428130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:01:06,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:01:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2025-03-17 15:01:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905846426] [2025-03-17 15:01:06,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:01:06,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 15:01:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:06,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 15:01:06,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 15:01:06,879 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:08,015 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-03-17 15:01:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-17 15:01:08,015 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 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 47 [2025-03-17 15:01:08,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:08,016 INFO L225 Difference]: With dead ends: 97 [2025-03-17 15:01:08,016 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 15:01:08,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1819, Invalid=4343, Unknown=0, NotChecked=0, Total=6162 [2025-03-17 15:01:08,018 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:08,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 3 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:01:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 15:01:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 15:01:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2025-03-17 15:01:08,025 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 47 [2025-03-17 15:01:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:08,026 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2025-03-17 15:01:08,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.0256410256410255) internal successors, (118), 40 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2025-03-17 15:01:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 15:01:08,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:08,027 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1] [2025-03-17 15:01:08,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:01:08,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:08,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:08,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash 886857277, now seen corresponding path program 4 times [2025-03-17 15:01:08,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:08,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393587074] [2025-03-17 15:01:08,234 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:01:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:08,242 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-17 15:01:08,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 15:01:08,261 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:01:08,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393587074] [2025-03-17 15:01:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393587074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:01:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103199012] [2025-03-17 15:01:08,874 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:01:08,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:01:08,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:01:08,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:01:08,896 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-03-17 15:01:08,914 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 15:01:08,914 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:01:08,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:08,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 15:01:08,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:01:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:09,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:01:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103199012] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:01:10,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:01:10,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 73 [2025-03-17 15:01:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103016867] [2025-03-17 15:01:10,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:01:10,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-17 15:01:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:10,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-17 15:01:10,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2025-03-17 15:01:10,244 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand has 74 states, 73 states have (on average 3.0136986301369864) internal successors, (220), 74 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:14,448 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2025-03-17 15:01:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-17 15:01:14,449 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 3.0136986301369864) internal successors, (220), 74 states have internal predecessors, (220), 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 95 [2025-03-17 15:01:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:14,449 INFO L225 Difference]: With dead ends: 193 [2025-03-17 15:01:14,449 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 15:01:14,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10966 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7939, Invalid=21817, Unknown=0, NotChecked=0, Total=29756 [2025-03-17 15:01:14,454 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 404 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:14,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 3 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 15:01:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 15:01:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-17 15:01:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2025-03-17 15:01:14,465 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 95 [2025-03-17 15:01:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:14,465 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2025-03-17 15:01:14,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.0136986301369864) internal successors, (220), 74 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2025-03-17 15:01:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 15:01:14,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:14,467 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1] [2025-03-17 15:01:14,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:01:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:14,669 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2072144013, now seen corresponding path program 5 times [2025-03-17 15:01:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133077391] [2025-03-17 15:01:14,671 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:01:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:14,691 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 191 statements into 32 equivalence classes. [2025-03-17 15:01:14,737 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 15:01:14,737 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-17 15:01:14,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133077391] [2025-03-17 15:01:16,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133077391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:01:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598379569] [2025-03-17 15:01:16,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:01:16,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:16,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:01:16,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:01:16,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:01:16,910 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 191 statements into 32 equivalence classes. [2025-03-17 15:01:16,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 15:01:16,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2025-03-17 15:01:16,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:16,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 15:01:16,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:01:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:19,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:01:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 2883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598379569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:01:23,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:01:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 65, 65] total 189 [2025-03-17 15:01:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158490636] [2025-03-17 15:01:23,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:01:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-03-17 15:01:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:01:23,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-03-17 15:01:23,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6560, Invalid=29350, Unknown=0, NotChecked=0, Total=35910 [2025-03-17 15:01:23,039 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand has 190 states, 189 states have (on average 2.9894179894179893) internal successors, (565), 190 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:01:40,861 INFO L93 Difference]: Finished difference Result 403 states and 437 transitions. [2025-03-17 15:01:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2025-03-17 15:01:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 2.9894179894179893) internal successors, (565), 190 states have internal predecessors, (565), 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 191 [2025-03-17 15:01:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:01:40,864 INFO L225 Difference]: With dead ends: 403 [2025-03-17 15:01:40,864 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 15:01:40,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55207 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=45426, Invalid=97836, Unknown=0, NotChecked=0, Total=143262 [2025-03-17 15:01:40,871 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 1953 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:01:40,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 3 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:01:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 15:01:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-03-17 15:01:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 1.0024937655860349) internal successors, (402), 401 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2025-03-17 15:01:40,893 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 191 [2025-03-17 15:01:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:01:40,894 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2025-03-17 15:01:40,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 2.9894179894179893) internal successors, (565), 190 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:01:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2025-03-17 15:01:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-17 15:01:40,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:01:40,901 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 1, 1, 1] [2025-03-17 15:01:40,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:01:41,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 15:01:41,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 15:01:41,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:01:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1684067780, now seen corresponding path program 6 times [2025-03-17 15:01:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:01:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979420029] [2025-03-17 15:01:41,106 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:01:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:01:41,116 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 401 statements into 67 equivalence classes. [2025-03-17 15:01:41,194 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) and asserted 401 of 401 statements. [2025-03-17 15:01:41,194 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2025-03-17 15:01:41,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:48,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:01:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979420029] [2025-03-17 15:01:48,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979420029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:01:48,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035069798] [2025-03-17 15:01:48,281 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 15:01:48,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:01:48,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:01:48,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:01:48,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:01:48,314 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 401 statements into 67 equivalence classes. [2025-03-17 15:01:48,408 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) and asserted 401 of 401 statements. [2025-03-17 15:01:48,408 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2025-03-17 15:01:48,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:01:48,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-17 15:01:48,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:01:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:01:55,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:02:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:02:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035069798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:02:09,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:02:09,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134, 134] total 393 [2025-03-17 15:02:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429956589] [2025-03-17 15:02:09,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:02:09,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 394 states [2025-03-17 15:02:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:02:09,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 394 interpolants. [2025-03-17 15:02:09,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23961, Invalid=130881, Unknown=0, NotChecked=0, Total=154842 [2025-03-17 15:02:09,513 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand has 394 states, 393 states have (on average 3.0025445292620865) internal successors, (1180), 394 states have internal predecessors, (1180), 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)