./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/rec_counter3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/rec_counter3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:33:43,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:33:43,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:33:43,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:33:43,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:33:43,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:33:43,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:33:43,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:33:43,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:33:43,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:33:43,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:33:43,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:33:43,137 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:33:43,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:33:43,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:33:43,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:33:43,139 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 [2025-03-04 10:33:43,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:33:43,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:33:43,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:33:43,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:33:43,433 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:33:43,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/rec_counter3.c [2025-03-04 10:33:44,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662a7a14f/54d2a8868f2641f386ef65586cdbef52/FLAGed21e6646 [2025-03-04 10:33:44,786 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:33:44,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/rec_counter3.c [2025-03-04 10:33:44,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662a7a14f/54d2a8868f2641f386ef65586cdbef52/FLAGed21e6646 [2025-03-04 10:33:45,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662a7a14f/54d2a8868f2641f386ef65586cdbef52 [2025-03-04 10:33:45,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:33:45,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:33:45,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:33:45,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:33:45,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:33:45,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22066c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45, skipping insertion in model container [2025-03-04 10:33:45,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:33:45,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:33:45,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:33:45,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:33:45,291 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:33:45,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45 WrapperNode [2025-03-04 10:33:45,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:33:45,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:33:45,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:33:45,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:33:45,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,308 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2025-03-04 10:33:45,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:33:45,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:33:45,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:33:45,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:33:45,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,319 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:33:45,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:33:45,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:33:45,329 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:33:45,329 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:33:45,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (1/1) ... [2025-03-04 10:33:45,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:33:45,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:45,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:33:45,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:33:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-03-04 10:33:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-03-04 10:33:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:33:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:33:45,402 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:33:45,403 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:33:45,476 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: havoc ~res~0, ~rescopy~0; [2025-03-04 10:33:45,496 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-04 10:33:45,497 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:33:45,503 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:33:45,504 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:33:45,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:33:45 BoogieIcfgContainer [2025-03-04 10:33:45,504 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:33:45,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:33:45,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:33:45,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:33:45,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:33:45" (1/3) ... [2025-03-04 10:33:45,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67888a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:33:45, skipping insertion in model container [2025-03-04 10:33:45,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:33:45" (2/3) ... [2025-03-04 10:33:45,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67888a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:33:45, skipping insertion in model container [2025-03-04 10:33:45,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:33:45" (3/3) ... [2025-03-04 10:33:45,513 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_counter3.c [2025-03-04 10:33:45,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:33:45,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_counter3.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-04 10:33:45,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:33:45,585 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;@633bc5c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:33:45,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 10:33:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:33:45,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:45,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:45,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:45,601 INFO L85 PathProgramCache]: Analyzing trace with hash -839714612, now seen corresponding path program 1 times [2025-03-04 10:33:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787595743] [2025-03-04 10:33:45,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:45,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:33:45,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:33:45,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787595743] [2025-03-04 10:33:45,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787595743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:45,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264279846] [2025-03-04 10:33:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:45,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:45,775 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:45,861 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-03-04 10:33:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:45,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:33:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:45,866 INFO L225 Difference]: With dead ends: 55 [2025-03-04 10:33:45,867 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 10:33:45,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:45,870 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:45,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 10:33:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-03-04 10:33:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-03-04 10:33:45,902 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2025-03-04 10:33:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:45,903 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-04 10:33:45,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-03-04 10:33:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:33:45,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:45,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:45,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:33:45,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -261349212, now seen corresponding path program 1 times [2025-03-04 10:33:45,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:45,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402315670] [2025-03-04 10:33:45,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:45,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:33:45,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:33:45,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:45,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:45,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402315670] [2025-03-04 10:33:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402315670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:45,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:45,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:45,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805686008] [2025-03-04 10:33:45,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:45,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:45,969 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,008 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-03-04 10:33:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:46,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:33:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,010 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:33:46,010 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:33:46,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:46,011 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:33:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-04 10:33:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-04 10:33:46,017 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 8 [2025-03-04 10:33:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-04 10:33:46,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-04 10:33:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:33:46,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:33:46,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1503400811, now seen corresponding path program 1 times [2025-03-04 10:33:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065721159] [2025-03-04 10:33:46,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:33:46,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:33:46,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,096 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-04 10:33:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065721159] [2025-03-04 10:33:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065721159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6201722] [2025-03-04 10:33:46,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:46,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:46,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:46,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:33:46,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:33:46,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:33:46,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:33:46,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:46,171 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-04 10:33:46,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:46,255 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-04 10:33:46,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6201722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:46,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:46,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:33:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338971862] [2025-03-04 10:33:46,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:33:46,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:33:46,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:33:46,259 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:46,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,340 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-04 10:33:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:33:46,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:33:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,342 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:33:46,342 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:33:46,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:33:46,343 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 89 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 82 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:33:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-03-04 10:33:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-04 10:33:46,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 12 [2025-03-04 10:33:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-04 10:33:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-04 10:33:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:33:46,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,351 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:46,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:46,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1539058700, now seen corresponding path program 1 times [2025-03-04 10:33:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693826629] [2025-03-04 10:33:46,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:46,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:46,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:46,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693826629] [2025-03-04 10:33:46,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693826629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:46,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:46,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:33:46,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551174649] [2025-03-04 10:33:46,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:33:46,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:33:46,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:46,620 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,631 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-04 10:33:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:33:46,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 10:33:46,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,632 INFO L225 Difference]: With dead ends: 32 [2025-03-04 10:33:46,634 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 10:33:46,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:46,635 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 10:33:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 10:33:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-04 10:33:46,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2025-03-04 10:33:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,642 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-04 10:33:46,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-04 10:33:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:33:46,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,642 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:33:46,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1539058673, now seen corresponding path program 1 times [2025-03-04 10:33:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099176208] [2025-03-04 10:33:46,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:33:46,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:33:46,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099176208] [2025-03-04 10:33:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099176208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:33:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733341083] [2025-03-04 10:33:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:33:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:33:46,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:46,682 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,690 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-04 10:33:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:33:46,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 10:33:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,691 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:33:46,692 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:33:46,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:33:46,692 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:33:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 10:33:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:33:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-04 10:33:46,696 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2025-03-04 10:33:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,696 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-04 10:33:46,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-04 10:33:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:33:46,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,697 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:33:46,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -466179468, now seen corresponding path program 1 times [2025-03-04 10:33:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532248142] [2025-03-04 10:33:46,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:33:46,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:33:46,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532248142] [2025-03-04 10:33:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532248142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:33:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824901513] [2025-03-04 10:33:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:46,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:46,755 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,774 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-03-04 10:33:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:46,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 10:33:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,775 INFO L225 Difference]: With dead ends: 52 [2025-03-04 10:33:46,775 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:33:46,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:46,776 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:33:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:33:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:33:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-04 10:33:46,783 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 17 [2025-03-04 10:33:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,783 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-04 10:33:46,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-04 10:33:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:33:46,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,784 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:33:46,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash -466178635, now seen corresponding path program 1 times [2025-03-04 10:33:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972873252] [2025-03-04 10:33:46,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:33:46,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:33:46,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:33:46,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972873252] [2025-03-04 10:33:46,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972873252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:46,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:33:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661195661] [2025-03-04 10:33:46,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:33:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:33:46,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:46,823 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,840 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-04 10:33:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:33:46,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 10:33:46,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,841 INFO L225 Difference]: With dead ends: 43 [2025-03-04 10:33:46,841 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:33:46,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:33:46,841 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 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-04 10:33:46,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:33:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:33:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-04 10:33:46,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 17 [2025-03-04 10:33:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,846 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-04 10:33:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-04 10:33:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:33:46,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,847 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:33:46,847 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:46,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash -618371193, now seen corresponding path program 1 times [2025-03-04 10:33:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623047962] [2025-03-04 10:33:46,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:33:46,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:46,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:33:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623047962] [2025-03-04 10:33:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623047962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236131908] [2025-03-04 10:33:46,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:46,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:46,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:46,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:33:46,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:33:46,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:33:46,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:46,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:46,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:33:47,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236131908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-04 10:33:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443484190] [2025-03-04 10:33:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:47,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:47,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:47,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:33:47,041 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:33:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:47,062 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-03-04 10:33:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:33:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:33:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:47,063 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:33:47,063 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:33:47,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:33:47,064 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:47,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:33:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 10:33:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-04 10:33:47,072 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2025-03-04 10:33:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:47,072 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-04 10:33:47,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:33:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-04 10:33:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:33:47,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:47,073 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:47,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:33:47,273 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-04 10:33:47,274 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:47,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash -781497212, now seen corresponding path program 1 times [2025-03-04 10:33:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954344606] [2025-03-04 10:33:47,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:47,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:33:47,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:33:47,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:47,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:33:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:47,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954344606] [2025-03-04 10:33:47,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954344606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710311445] [2025-03-04 10:33:47,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:47,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:47,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:47,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:47,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:33:47,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:33:47,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:33:47,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:47,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:47,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:47,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:33:47,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:33:47,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710311445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:47,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:47,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-03-04 10:33:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210751616] [2025-03-04 10:33:47,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:47,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:33:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:47,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:33:47,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:47,599 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:33:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:47,771 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2025-03-04 10:33:47,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:33:47,772 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 31 [2025-03-04 10:33:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:47,774 INFO L225 Difference]: With dead ends: 110 [2025-03-04 10:33:47,774 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 10:33:47,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:33:47,775 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:47,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 10:33:47,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-03-04 10:33:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-04 10:33:47,785 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 31 [2025-03-04 10:33:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:47,785 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-04 10:33:47,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:33:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-03-04 10:33:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:33:47,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:47,787 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:47,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:33:47,992 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-04 10:33:47,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:47,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash -764071861, now seen corresponding path program 2 times [2025-03-04 10:33:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058964850] [2025-03-04 10:33:47,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:48,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 10:33:48,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:33:48,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:48,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 121 proven. 29 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 10:33:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058964850] [2025-03-04 10:33:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058964850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872388355] [2025-03-04 10:33:48,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:48,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:48,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:48,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:48,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:33:48,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 10:33:48,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:33:48,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:48,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:33:48,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 10:33:48,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 10:33:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872388355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:49,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:49,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 22 [2025-03-04 10:33:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297640750] [2025-03-04 10:33:49,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:49,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:33:49,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:49,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:33:49,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:49,197 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:33:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:49,498 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2025-03-04 10:33:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:33:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) Word has length 82 [2025-03-04 10:33:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:49,499 INFO L225 Difference]: With dead ends: 143 [2025-03-04 10:33:49,499 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 10:33:49,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:33:49,501 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:49,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 152 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 10:33:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 10:33:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-03-04 10:33:49,515 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 82 [2025-03-04 10:33:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-03-04 10:33:49,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 18 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:33:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-03-04 10:33:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 10:33:49,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:49,521 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:49,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:49,722 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-04 10:33:49,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:49,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash -368853993, now seen corresponding path program 3 times [2025-03-04 10:33:49,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:49,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058742849] [2025-03-04 10:33:49,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:49,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:49,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 8 equivalence classes. [2025-03-04 10:33:49,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 98 statements. [2025-03-04 10:33:49,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:33:49,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-04 10:33:49,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:49,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058742849] [2025-03-04 10:33:49,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058742849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:49,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015521670] [2025-03-04 10:33:49,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:49,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:49,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:49,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:49,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:33:49,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 8 equivalence classes. [2025-03-04 10:33:49,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 98 statements. [2025-03-04 10:33:49,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:33:49,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:49,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:33:49,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-04 10:33:49,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-04 10:33:50,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015521670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:50,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:50,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 10:33:50,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819921516] [2025-03-04 10:33:50,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:50,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:33:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:50,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:33:50,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:50,085 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:50,142 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2025-03-04 10:33:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:33:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2025-03-04 10:33:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:50,145 INFO L225 Difference]: With dead ends: 175 [2025-03-04 10:33:50,146 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 10:33:50,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:50,147 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:50,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 10:33:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2025-03-04 10:33:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-03-04 10:33:50,180 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 98 [2025-03-04 10:33:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:50,181 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-03-04 10:33:50,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:33:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-03-04 10:33:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 10:33:50,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:50,182 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:50,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:50,386 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-04 10:33:50,387 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:50,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 932682807, now seen corresponding path program 4 times [2025-03-04 10:33:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179528814] [2025-03-04 10:33:50,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:50,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-04 10:33:50,415 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 10:33:50,415 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:50,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 211 proven. 126 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 10:33:50,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179528814] [2025-03-04 10:33:50,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179528814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917902722] [2025-03-04 10:33:50,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:50,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:50,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:33:50,971 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-04 10:33:50,989 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 10:33:50,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:50,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:33:50,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 10:33:51,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 10:33:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917902722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:52,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:52,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 16] total 50 [2025-03-04 10:33:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452480075] [2025-03-04 10:33:52,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:52,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-04 10:33:52,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:52,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-04 10:33:52,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2166, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:33:52,034 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 50 states, 50 states have (on average 2.54) internal successors, (127), 40 states have internal predecessors, (127), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 10:33:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:52,790 INFO L93 Difference]: Finished difference Result 498 states and 562 transitions. [2025-03-04 10:33:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-04 10:33:52,790 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 40 states have internal predecessors, (127), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2025-03-04 10:33:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:52,791 INFO L225 Difference]: With dead ends: 498 [2025-03-04 10:33:52,791 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 10:33:52,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3448 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1156, Invalid=8350, Unknown=0, NotChecked=0, Total=9506 [2025-03-04 10:33:52,797 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:52,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 259 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 10:33:52,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 202. [2025-03-04 10:33:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 187 states have (on average 1.0748663101604279) internal successors, (201), 187 states have internal predecessors, (201), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:33:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2025-03-04 10:33:52,817 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 100 [2025-03-04 10:33:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2025-03-04 10:33:52,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 40 states have internal predecessors, (127), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 10:33:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2025-03-04 10:33:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-04 10:33:52,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:52,822 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:52,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:53,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:53,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:53,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1800936407, now seen corresponding path program 5 times [2025-03-04 10:33:53,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:53,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94039697] [2025-03-04 10:33:53,027 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:53,038 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 220 statements into 14 equivalence classes. [2025-03-04 10:33:53,052 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 94 of 220 statements. [2025-03-04 10:33:53,052 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 10:33:53,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1041 proven. 53 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2025-03-04 10:33:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94039697] [2025-03-04 10:33:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94039697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868706078] [2025-03-04 10:33:53,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:53,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:53,262 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:53,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:33:53,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 220 statements into 14 equivalence classes. [2025-03-04 10:33:53,326 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 94 of 220 statements. [2025-03-04 10:33:53,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-04 10:33:53,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:53,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:33:53,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1025 proven. 88 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-04 10:33:53,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2363 backedges. 1043 proven. 70 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-04 10:33:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868706078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:54,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 23 [2025-03-04 10:33:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159526748] [2025-03-04 10:33:54,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:54,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:33:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:54,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:33:54,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:33:54,267 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:33:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:54,565 INFO L93 Difference]: Finished difference Result 347 states and 378 transitions. [2025-03-04 10:33:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:33:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 220 [2025-03-04 10:33:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:54,567 INFO L225 Difference]: With dead ends: 347 [2025-03-04 10:33:54,567 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 10:33:54,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 421 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:33:54,568 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:54,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 10:33:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-04 10:33:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 202 states have (on average 1.0594059405940595) internal successors, (214), 202 states have internal predecessors, (214), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:33:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 229 transitions. [2025-03-04 10:33:54,579 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 229 transitions. Word has length 220 [2025-03-04 10:33:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:54,579 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 229 transitions. [2025-03-04 10:33:54,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 21 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 10:33:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 229 transitions. [2025-03-04 10:33:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-04 10:33:54,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:54,591 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:54,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:33:54,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:54,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:54,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash 923560347, now seen corresponding path program 6 times [2025-03-04 10:33:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:54,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329290258] [2025-03-04 10:33:54,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:54,805 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 238 statements into 14 equivalence classes. [2025-03-04 10:33:54,832 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 172 of 238 statements. [2025-03-04 10:33:54,832 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-04 10:33:54,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2025-03-04 10:33:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329290258] [2025-03-04 10:33:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329290258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233733720] [2025-03-04 10:33:55,061 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:55,063 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:55,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:33:55,118 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 238 statements into 14 equivalence classes. [2025-03-04 10:33:55,156 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 172 of 238 statements. [2025-03-04 10:33:55,156 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-04 10:33:55,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:33:55,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2025-03-04 10:33:55,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 1093 proven. 120 refuted. 0 times theorem prover too weak. 1819 trivial. 0 not checked. [2025-03-04 10:33:55,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233733720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:55,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:55,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2025-03-04 10:33:55,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436054904] [2025-03-04 10:33:55,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:55,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:33:55,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:55,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:33:55,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:33:55,706 INFO L87 Difference]: Start difference. First operand 217 states and 229 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:33:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:56,089 INFO L93 Difference]: Finished difference Result 614 states and 695 transitions. [2025-03-04 10:33:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 10:33:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 238 [2025-03-04 10:33:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:56,092 INFO L225 Difference]: With dead ends: 614 [2025-03-04 10:33:56,092 INFO L226 Difference]: Without dead ends: 555 [2025-03-04 10:33:56,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=676, Invalid=2404, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 10:33:56,094 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:56,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-04 10:33:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 247. [2025-03-04 10:33:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 232 states have internal predecessors, (252), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:33:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 267 transitions. [2025-03-04 10:33:56,116 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 267 transitions. Word has length 238 [2025-03-04 10:33:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 267 transitions. [2025-03-04 10:33:56,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:33:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 267 transitions. [2025-03-04 10:33:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-04 10:33:56,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:56,118 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:56,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:56,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:33:56,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:33:56,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1736679569, now seen corresponding path program 7 times [2025-03-04 10:33:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044597122] [2025-03-04 10:33:56,324 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:56,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 10:33:56,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 10:33:56,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:56,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 2388 proven. 90 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2025-03-04 10:33:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044597122] [2025-03-04 10:33:56,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044597122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:56,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216865191] [2025-03-04 10:33:56,804 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:56,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:56,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:56,805 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:56,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:33:56,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 10:33:56,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 10:33:56,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:56,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:56,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:33:56,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 1958 proven. 177 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-04 10:33:57,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4092 backedges. 1958 proven. 177 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-04 10:34:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216865191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:00,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28, 28] total 37 [2025-03-04 10:34:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365146902] [2025-03-04 10:34:00,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:00,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 10:34:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:00,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 10:34:00,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:34:00,037 INFO L87 Difference]: Start difference. First operand 247 states and 267 transitions. Second operand has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:34:00,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:00,607 INFO L93 Difference]: Finished difference Result 413 states and 454 transitions. [2025-03-04 10:34:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 10:34:00,607 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 262 [2025-03-04 10:34:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:00,608 INFO L225 Difference]: With dead ends: 413 [2025-03-04 10:34:00,608 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 10:34:00,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 482 SyntacticMatches, 26 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=512, Invalid=3910, Unknown=0, NotChecked=0, Total=4422 [2025-03-04 10:34:00,610 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:00,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:34:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 10:34:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-04 10:34:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 241 states have (on average 1.070539419087137) internal successors, (258), 241 states have internal predecessors, (258), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:34:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2025-03-04 10:34:00,631 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 262 [2025-03-04 10:34:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:00,631 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2025-03-04 10:34:00,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5135135135135136) internal successors, (93), 31 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:34:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2025-03-04 10:34:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-04 10:34:00,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:00,637 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:00,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:34:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:34:00,838 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:00,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash -38052587, now seen corresponding path program 8 times [2025-03-04 10:34:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782562293] [2025-03-04 10:34:00,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:00,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 271 statements into 2 equivalence classes. [2025-03-04 10:34:00,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 271 of 271 statements. [2025-03-04 10:34:00,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:00,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2742 proven. 138 refuted. 0 times theorem prover too weak. 1659 trivial. 0 not checked. [2025-03-04 10:34:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782562293] [2025-03-04 10:34:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782562293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296628881] [2025-03-04 10:34:01,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:34:01,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:01,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:01,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:01,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:34:01,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 271 statements into 2 equivalence classes. [2025-03-04 10:34:01,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 271 of 271 statements. [2025-03-04 10:34:01,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:34:01,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:01,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:34:01,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2566 proven. 311 refuted. 0 times theorem prover too weak. 1662 trivial. 0 not checked. [2025-03-04 10:34:01,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4539 backedges. 2566 proven. 311 refuted. 0 times theorem prover too weak. 1662 trivial. 0 not checked. [2025-03-04 10:34:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296628881] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:05,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 44 [2025-03-04 10:34:05,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858542282] [2025-03-04 10:34:05,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:05,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:34:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:05,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:34:05,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:34:05,069 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:06,015 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2025-03-04 10:34:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-04 10:34:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 271 [2025-03-04 10:34:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:06,016 INFO L225 Difference]: With dead ends: 407 [2025-03-04 10:34:06,017 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 10:34:06,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 492 SyntacticMatches, 31 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=823, Invalid=6659, Unknown=0, NotChecked=0, Total=7482 [2025-03-04 10:34:06,019 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:06,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:34:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 10:34:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-04 10:34:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 250 states have (on average 1.06) internal successors, (265), 250 states have internal predecessors, (265), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:34:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 280 transitions. [2025-03-04 10:34:06,035 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 280 transitions. Word has length 271 [2025-03-04 10:34:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:06,035 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 280 transitions. [2025-03-04 10:34:06,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 280 transitions. [2025-03-04 10:34:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-04 10:34:06,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:06,038 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:06,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:34:06,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:34:06,238 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1003439445, now seen corresponding path program 9 times [2025-03-04 10:34:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111016270] [2025-03-04 10:34:06,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:06,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 280 statements into 14 equivalence classes. [2025-03-04 10:34:06,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 196 of 280 statements. [2025-03-04 10:34:06,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 10:34:06,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-03-04 10:34:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111016270] [2025-03-04 10:34:06,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111016270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126293247] [2025-03-04 10:34:06,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:06,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:06,655 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:06,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:34:06,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 280 statements into 14 equivalence classes. [2025-03-04 10:34:06,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 196 of 280 statements. [2025-03-04 10:34:06,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 10:34:06,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:06,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:34:06,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-03-04 10:34:06,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 2343 proven. 678 refuted. 0 times theorem prover too weak. 1992 trivial. 0 not checked. [2025-03-04 10:34:07,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126293247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:07,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:07,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 43 [2025-03-04 10:34:07,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143412762] [2025-03-04 10:34:07,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:07,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:34:07,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:07,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:34:07,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:34:07,896 INFO L87 Difference]: Start difference. First operand 265 states and 280 transitions. Second operand has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:34:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:09,134 INFO L93 Difference]: Finished difference Result 947 states and 1070 transitions. [2025-03-04 10:34:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-04 10:34:09,135 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 280 [2025-03-04 10:34:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:09,138 INFO L225 Difference]: With dead ends: 947 [2025-03-04 10:34:09,138 INFO L226 Difference]: Without dead ends: 827 [2025-03-04 10:34:09,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4731 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2981, Invalid=11299, Unknown=0, NotChecked=0, Total=14280 [2025-03-04 10:34:09,142 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:09,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-04 10:34:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 328. [2025-03-04 10:34:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 313 states have (on average 1.1022364217252396) internal successors, (345), 313 states have internal predecessors, (345), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:34:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 360 transitions. [2025-03-04 10:34:09,197 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 360 transitions. Word has length 280 [2025-03-04 10:34:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:09,198 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 360 transitions. [2025-03-04 10:34:09,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:34:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 360 transitions. [2025-03-04 10:34:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-04 10:34:09,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:09,203 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:09,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:34:09,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:34:09,404 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:09,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1431471179, now seen corresponding path program 10 times [2025-03-04 10:34:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:09,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016432502] [2025-03-04 10:34:09,405 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:09,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:09,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 341 statements into 2 equivalence classes. [2025-03-04 10:34:09,485 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 341 of 341 statements. [2025-03-04 10:34:09,485 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:09,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8328 backedges. 4040 proven. 137 refuted. 0 times theorem prover too weak. 4151 trivial. 0 not checked. [2025-03-04 10:34:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016432502] [2025-03-04 10:34:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016432502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965265325] [2025-03-04 10:34:10,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:10,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:10,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:10,172 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:10,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:34:10,329 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 341 statements into 2 equivalence classes. [2025-03-04 10:34:10,398 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 341 of 341 statements. [2025-03-04 10:34:10,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:10,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 10:34:10,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8328 backedges. 3597 proven. 765 refuted. 0 times theorem prover too weak. 3966 trivial. 0 not checked. [2025-03-04 10:34:10,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8328 backedges. 3597 proven. 765 refuted. 0 times theorem prover too weak. 3966 trivial. 0 not checked. [2025-03-04 10:34:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965265325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:13,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:13,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 35, 35] total 46 [2025-03-04 10:34:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526740832] [2025-03-04 10:34:13,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:13,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 10:34:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:13,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 10:34:13,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1863, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:34:13,990 INFO L87 Difference]: Start difference. First operand 328 states and 360 transitions. Second operand has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 39 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:14,587 INFO L93 Difference]: Finished difference Result 590 states and 654 transitions. [2025-03-04 10:34:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-03-04 10:34:14,588 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 39 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 341 [2025-03-04 10:34:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:14,589 INFO L225 Difference]: With dead ends: 590 [2025-03-04 10:34:14,589 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 10:34:14,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 633 SyntacticMatches, 32 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3891 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1068, Invalid=7488, Unknown=0, NotChecked=0, Total=8556 [2025-03-04 10:34:14,592 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:14,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 10:34:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-03-04 10:34:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 336 states have (on average 1.0922619047619047) internal successors, (367), 336 states have internal predecessors, (367), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 10:34:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 383 transitions. [2025-03-04 10:34:14,622 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 383 transitions. Word has length 341 [2025-03-04 10:34:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:14,623 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 383 transitions. [2025-03-04 10:34:14,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.369565217391304) internal successors, (109), 39 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 10:34:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 383 transitions. [2025-03-04 10:34:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-03-04 10:34:14,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:14,625 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 15, 14, 14, 14, 14, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:14,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:34:14,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:34:14,829 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:14,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1267495436, now seen corresponding path program 11 times [2025-03-04 10:34:14,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:14,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443595201] [2025-03-04 10:34:14,829 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:14,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:14,839 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 370 statements into 17 equivalence classes. [2025-03-04 10:34:14,871 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 327 of 370 statements. [2025-03-04 10:34:14,871 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-04 10:34:14,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 5962 proven. 788 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-04 10:34:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443595201] [2025-03-04 10:34:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443595201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338039087] [2025-03-04 10:34:15,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:15,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:15,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:15,517 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:15,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:34:15,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 370 statements into 17 equivalence classes. [2025-03-04 10:34:15,762 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 327 of 370 statements. [2025-03-04 10:34:15,763 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-04 10:34:15,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:15,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 10:34:15,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 5993 proven. 826 refuted. 0 times theorem prover too weak. 3051 trivial. 0 not checked. [2025-03-04 10:34:15,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 6107 proven. 712 refuted. 0 times theorem prover too weak. 3051 trivial. 0 not checked. [2025-03-04 10:34:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338039087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:19,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38, 38] total 45 [2025-03-04 10:34:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557350766] [2025-03-04 10:34:19,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:19,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 10:34:19,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:19,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 10:34:19,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1761, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 10:34:19,135 INFO L87 Difference]: Start difference. First operand 352 states and 383 transitions. Second operand has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 39 states have internal predecessors, (111), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:34:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:20,422 INFO L93 Difference]: Finished difference Result 590 states and 652 transitions. [2025-03-04 10:34:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-04 10:34:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 39 states have internal predecessors, (111), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 370 [2025-03-04 10:34:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:20,424 INFO L225 Difference]: With dead ends: 590 [2025-03-04 10:34:20,424 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 10:34:20,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 698 SyntacticMatches, 33 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1642, Invalid=10130, Unknown=0, NotChecked=0, Total=11772 [2025-03-04 10:34:20,427 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:20,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:34:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 10:34:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 10:34:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 339 states have (on average 1.0678466076696165) internal successors, (362), 339 states have internal predecessors, (362), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 10:34:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 378 transitions. [2025-03-04 10:34:20,479 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 378 transitions. Word has length 370 [2025-03-04 10:34:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:20,479 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 378 transitions. [2025-03-04 10:34:20,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.466666666666667) internal successors, (111), 39 states have internal predecessors, (111), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:34:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 378 transitions. [2025-03-04 10:34:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-04 10:34:20,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:20,482 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 15, 14, 14, 14, 14, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:20,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:34:20,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:20,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:20,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1217000068, now seen corresponding path program 12 times [2025-03-04 10:34:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601671025] [2025-03-04 10:34:20,686 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:34:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:20,699 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 373 statements into 17 equivalence classes. [2025-03-04 10:34:20,750 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 373 of 373 statements. [2025-03-04 10:34:20,750 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-04 10:34:20,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 2656 proven. 247 refuted. 0 times theorem prover too weak. 7201 trivial. 0 not checked. [2025-03-04 10:34:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601671025] [2025-03-04 10:34:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601671025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840050880] [2025-03-04 10:34:21,334 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:34:21,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:21,338 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:21,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:34:21,582 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 373 statements into 17 equivalence classes. [2025-03-04 10:34:21,651 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 373 of 373 statements. [2025-03-04 10:34:21,651 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-04 10:34:21,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:21,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:34:21,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 2558 proven. 5849 refuted. 0 times theorem prover too weak. 1697 trivial. 0 not checked. [2025-03-04 10:34:22,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10104 backedges. 2558 proven. 5849 refuted. 0 times theorem prover too weak. 1697 trivial. 0 not checked. [2025-03-04 10:34:25,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840050880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:25,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:25,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 31] total 78 [2025-03-04 10:34:25,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684201807] [2025-03-04 10:34:25,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:25,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-03-04 10:34:25,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:25,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-03-04 10:34:25,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=5328, Unknown=0, NotChecked=0, Total=6162 [2025-03-04 10:34:25,870 INFO L87 Difference]: Start difference. First operand 355 states and 378 transitions. Second operand has 79 states, 78 states have (on average 2.269230769230769) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 10:34:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:35,860 INFO L93 Difference]: Finished difference Result 1572 states and 1797 transitions. [2025-03-04 10:34:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 408 states. [2025-03-04 10:34:35,861 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 2.269230769230769) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) Word has length 373 [2025-03-04 10:34:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:35,865 INFO L225 Difference]: With dead ends: 1572 [2025-03-04 10:34:35,865 INFO L226 Difference]: Without dead ends: 1158 [2025-03-04 10:34:35,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70292 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=30406, Invalid=136466, Unknown=0, NotChecked=0, Total=166872 [2025-03-04 10:34:35,874 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:35,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:34:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-03-04 10:34:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 787. [2025-03-04 10:34:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 764 states have (on average 1.1282722513089005) internal successors, (862), 764 states have internal predecessors, (862), 3 states have call successors, (3), 2 states have call predecessors, (3), 19 states have return successors, (20), 20 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 10:34:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 885 transitions. [2025-03-04 10:34:35,938 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 885 transitions. Word has length 373 [2025-03-04 10:34:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:35,939 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 885 transitions. [2025-03-04 10:34:35,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 2.269230769230769) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 10:34:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 885 transitions. [2025-03-04 10:34:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2025-03-04 10:34:35,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:35,944 INFO L218 NwaCegarLoop]: trace histogram [199, 199, 199, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1] [2025-03-04 10:34:35,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:34:36,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:36,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:34:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1701151401, now seen corresponding path program 13 times [2025-03-04 10:34:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107022265] [2025-03-04 10:34:36,146 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:34:36,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:36,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 812 statements into 1 equivalence classes. [2025-03-04 10:34:36,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 812 of 812 statements. [2025-03-04 10:34:36,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:36,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 64803 backedges. 31011 proven. 9572 refuted. 0 times theorem prover too weak. 24220 trivial. 0 not checked. [2025-03-04 10:34:39,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107022265] [2025-03-04 10:34:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107022265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826399071] [2025-03-04 10:34:39,976 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:34:39,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:39,978 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:34:39,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:34:40,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 812 statements into 1 equivalence classes. [2025-03-04 10:34:40,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 812 of 812 statements. [2025-03-04 10:34:40,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:34:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:40,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 10:34:40,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 64803 backedges. 31045 proven. 9531 refuted. 0 times theorem prover too weak. 24227 trivial. 0 not checked. [2025-03-04 10:34:40,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:35:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 64803 backedges. 31045 proven. 9531 refuted. 0 times theorem prover too weak. 24227 trivial. 0 not checked. [2025-03-04 10:35:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826399071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:35:03,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:35:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 68 [2025-03-04 10:35:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750986636] [2025-03-04 10:35:03,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:35:03,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 10:35:03,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:35:03,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 10:35:03,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4043, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:35:03,061 INFO L87 Difference]: Start difference. First operand 787 states and 885 transitions. Second operand has 68 states, 68 states have (on average 2.2794117647058822) internal successors, (155), 55 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:35:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:35:05,667 INFO L93 Difference]: Finished difference Result 1823 states and 2058 transitions. [2025-03-04 10:35:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2025-03-04 10:35:05,668 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.2794117647058822) internal successors, (155), 55 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) Word has length 812 [2025-03-04 10:35:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:35:05,672 INFO L225 Difference]: With dead ends: 1823 [2025-03-04 10:35:05,672 INFO L226 Difference]: Without dead ends: 1177 [2025-03-04 10:35:05,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1831 GetRequests, 1560 SyntacticMatches, 62 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17608 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6192, Invalid=38118, Unknown=0, NotChecked=0, Total=44310 [2025-03-04 10:35:05,678 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:35:05,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:35:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-04 10:35:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1060. [2025-03-04 10:35:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1030 states have (on average 1.1135922330097088) internal successors, (1147), 1030 states have internal predecessors, (1147), 3 states have call successors, (3), 2 states have call predecessors, (3), 26 states have return successors, (27), 27 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-04 10:35:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1177 transitions. [2025-03-04 10:35:05,809 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1177 transitions. Word has length 812 [2025-03-04 10:35:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:35:05,809 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1177 transitions. [2025-03-04 10:35:05,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.2794117647058822) internal successors, (155), 55 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 10:35:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1177 transitions. [2025-03-04 10:35:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2025-03-04 10:35:05,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:35:05,815 INFO L218 NwaCegarLoop]: trace histogram [207, 207, 207, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1] [2025-03-04 10:35:05,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:35:06,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:06,015 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 10:35:06,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:35:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash 106270436, now seen corresponding path program 14 times [2025-03-04 10:35:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:35:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93936202] [2025-03-04 10:35:06,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:35:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:35:06,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 847 statements into 2 equivalence classes. [2025-03-04 10:35:06,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 847 of 847 statements. [2025-03-04 10:35:06,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:35:06,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 70233 backedges. 26455 proven. 997 refuted. 0 times theorem prover too weak. 42781 trivial. 0 not checked. [2025-03-04 10:35:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:35:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93936202] [2025-03-04 10:35:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93936202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:35:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698140929] [2025-03-04 10:35:08,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:35:08,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:35:08,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:35:08,909 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:35:08,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:35:09,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 847 statements into 2 equivalence classes. [2025-03-04 10:35:09,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 847 of 847 statements. [2025-03-04 10:35:09,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:35:09,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:35:09,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1923 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:35:09,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:35:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 70233 backedges. 26353 proven. 1073 refuted. 0 times theorem prover too weak. 42807 trivial. 0 not checked. [2025-03-04 10:35:09,925 INFO L312 TraceCheckSpWp]: Computing backward predicates...