./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/recursive/Primes.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:41:00,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:41:00,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:41:00,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:41:00,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:41:00,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:41:00,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:41:00,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:41:00,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:41:00,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:41:00,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:41:00,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:41:00,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:41:00,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:41:00,076 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:41:00,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:41:00,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:41:00,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:00,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:41:00,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:41:00,079 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2025-03-09 02:41:00,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:41:00,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:41:00,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:41:00,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:41:00,297 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:41:00,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2025-03-09 02:41:01,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9812a4969/db5f85576bad4d11aa18b6e6ec3f511f/FLAG63dc3b125 [2025-03-09 02:41:01,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:41:01,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2025-03-09 02:41:01,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9812a4969/db5f85576bad4d11aa18b6e6ec3f511f/FLAG63dc3b125 [2025-03-09 02:41:01,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9812a4969/db5f85576bad4d11aa18b6e6ec3f511f [2025-03-09 02:41:01,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:41:01,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:41:01,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:01,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:41:01,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:41:01,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24975776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01, skipping insertion in model container [2025-03-09 02:41:01,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:41:02,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:02,096 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:41:02,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:02,122 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:41:02,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02 WrapperNode [2025-03-09 02:41:02,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:02,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:02,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:41:02,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:41:02,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,147 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-09 02:41:02,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:02,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:41:02,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:41:02,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:41:02,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,171 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:41:02,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:41:02,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:41:02,180 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:41:02,180 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:41:02,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (1/1) ... [2025-03-09 02:41:02,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:02,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:02,211 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-09 02:41:02,217 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-09 02:41:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2025-03-09 02:41:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2025-03-09 02:41:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:41:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-09 02:41:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-09 02:41:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2025-03-09 02:41:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2025-03-09 02:41:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:41:02,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:41:02,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:41:02,284 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:41:02,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:41:02,363 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: havoc #t~ret6; [2025-03-09 02:41:02,364 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc #t~ret8; [2025-03-09 02:41:02,364 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc #t~ret7; [2025-03-09 02:41:02,401 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc #t~ret5; [2025-03-09 02:41:02,401 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-09 02:41:02,460 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc is_prime_#t~ret9#1; [2025-03-09 02:41:02,488 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret11; [2025-03-09 02:41:02,499 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-09 02:41:02,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:41:02,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:41:02,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:41:02,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:02 BoogieIcfgContainer [2025-03-09 02:41:02,512 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:41:02,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:41:02,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:41:02,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:41:02,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:41:01" (1/3) ... [2025-03-09 02:41:02,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c275631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:02, skipping insertion in model container [2025-03-09 02:41:02,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:02" (2/3) ... [2025-03-09 02:41:02,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c275631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:02, skipping insertion in model container [2025-03-09 02:41:02,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:02" (3/3) ... [2025-03-09 02:41:02,519 INFO L128 eAbstractionObserver]: Analyzing ICFG Primes.c [2025-03-09 02:41:02,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:41:02,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Primes.c that has 4 procedures, 84 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-09 02:41:02,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:41:02,572 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;@c2776d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:41:02,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 02:41:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.6) internal successors, (88), 71 states have internal predecessors, (88), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:41:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 02:41:02,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 02:41:02,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:02,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 3754619, now seen corresponding path program 1 times [2025-03-09 02:41:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804767637] [2025-03-09 02:41:02,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 02:41:02,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 02:41:02,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,736 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-09 02:41:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804767637] [2025-03-09 02:41:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804767637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235906282] [2025-03-09 02:41:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:02,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:02,753 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.6) internal successors, (88), 71 states have internal predecessors, (88), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,783 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2025-03-09 02:41:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 02:41:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,791 INFO L225 Difference]: With dead ends: 87 [2025-03-09 02:41:02,791 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:41:02,793 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-09 02:41:02,794 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 196 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-09 02:41:02,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 196 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:41:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-09 02:41:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 64 states have internal predecessors, (76), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:41:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2025-03-09 02:41:02,827 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 4 [2025-03-09 02:41:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,828 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2025-03-09 02:41:02,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2025-03-09 02:41:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 02:41:02,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 02:41:02,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:41:02,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 116393241, now seen corresponding path program 1 times [2025-03-09 02:41:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124601411] [2025-03-09 02:41:02,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 02:41:02,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 02:41:02,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,869 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-09 02:41:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124601411] [2025-03-09 02:41:02,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124601411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:02,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834430337] [2025-03-09 02:41:02,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:02,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:02,871 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,882 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-03-09 02:41:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 02:41:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,883 INFO L225 Difference]: With dead ends: 76 [2025-03-09 02:41:02,883 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 02:41:02,883 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-09 02:41:02,884 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:02,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 176 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 02:41:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-09 02:41:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.530612244897959) internal successors, (75), 63 states have internal predecessors, (75), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:41:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2025-03-09 02:41:02,893 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 5 [2025-03-09 02:41:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,893 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2025-03-09 02:41:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2025-03-09 02:41:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:41:02,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:41:02,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting multiple_ofErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash 345767712, now seen corresponding path program 1 times [2025-03-09 02:41:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160158512] [2025-03-09 02:41:02,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:41:02,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:41:02,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,943 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-09 02:41:02,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160158512] [2025-03-09 02:41:02,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160158512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:02,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002197883] [2025-03-09 02:41:02,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:02,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:02,945 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,973 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2025-03-09 02:41:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 02:41:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,978 INFO L225 Difference]: With dead ends: 77 [2025-03-09 02:41:02,979 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 02:41:02,979 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-09 02:41:02,980 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:02,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 173 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 02:41:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-09 02:41:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.510204081632653) internal successors, (74), 62 states have internal predecessors, (74), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:41:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2025-03-09 02:41:02,988 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 15 [2025-03-09 02:41:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,988 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2025-03-09 02:41:02,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2025-03-09 02:41:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:41:02,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:41:02,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting multiple_ofErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:02,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2128864473, now seen corresponding path program 1 times [2025-03-09 02:41:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575482915] [2025-03-09 02:41:02,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:41:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:41:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,055 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-09 02:41:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575482915] [2025-03-09 02:41:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575482915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870619020] [2025-03-09 02:41:03,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:03,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:03,056 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,121 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2025-03-09 02:41:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:03,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 02:41:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,123 INFO L225 Difference]: With dead ends: 138 [2025-03-09 02:41:03,123 INFO L226 Difference]: Without dead ends: 70 [2025-03-09 02:41:03,123 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-09 02:41:03,124 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 40 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 249 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-09 02:41:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-09 02:41:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 57 states have internal predecessors, (67), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:41:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-09 02:41:03,133 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 16 [2025-03-09 02:41:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,133 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-09 02:41:03,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-09 02:41:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:41:03,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:41:03,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting multiple_ofErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2128865210, now seen corresponding path program 1 times [2025-03-09 02:41:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506372982] [2025-03-09 02:41:03,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:41:03,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:41:03,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,183 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-09 02:41:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506372982] [2025-03-09 02:41:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506372982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:03,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982788314] [2025-03-09 02:41:03,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:03,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:03,184 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,203 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-03-09 02:41:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:03,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 02:41:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,204 INFO L225 Difference]: With dead ends: 70 [2025-03-09 02:41:03,204 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 02:41:03,205 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-09 02:41:03,205 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 151 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:03,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 02:41:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-09 02:41:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 56 states have internal predecessors, (66), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:41:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-09 02:41:03,215 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 16 [2025-03-09 02:41:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,215 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-09 02:41:03,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-09 02:41:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 02:41:03,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:41:03,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1570312054, now seen corresponding path program 1 times [2025-03-09 02:41:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463989328] [2025-03-09 02:41:03,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:41:03,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:41:03,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,259 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-09 02:41:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463989328] [2025-03-09 02:41:03,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463989328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:03,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534301009] [2025-03-09 02:41:03,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:03,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:03,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:03,262 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,325 INFO L93 Difference]: Finished difference Result 143 states and 176 transitions. [2025-03-09 02:41:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 02:41:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,328 INFO L225 Difference]: With dead ends: 143 [2025-03-09 02:41:03,328 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 02:41:03,328 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-09 02:41:03,330 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 271 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 02:41:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-03-09 02:41:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4) internal successors, (77), 65 states have internal predecessors, (77), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:41:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2025-03-09 02:41:03,341 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 17 [2025-03-09 02:41:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2025-03-09 02:41:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2025-03-09 02:41:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:41:03,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:41:03,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1435057232, now seen corresponding path program 1 times [2025-03-09 02:41:03,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500080905] [2025-03-09 02:41:03,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:41:03,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:41:03,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,416 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-09 02:41:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500080905] [2025-03-09 02:41:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500080905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:41:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760302324] [2025-03-09 02:41:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:41:03,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:41:03,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:41:03,417 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,513 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2025-03-09 02:41:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:03,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 02:41:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,514 INFO L225 Difference]: With dead ends: 82 [2025-03-09 02:41:03,514 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 02:41:03,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:41:03,515 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 38 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 277 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 02:41:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-09 02:41:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:41:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2025-03-09 02:41:03,524 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 18 [2025-03-09 02:41:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,524 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2025-03-09 02:41:03,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2025-03-09 02:41:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 02:41:03,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:41:03,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1537101205, now seen corresponding path program 1 times [2025-03-09 02:41:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001000228] [2025-03-09 02:41:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:41:03,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:41:03,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,614 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-09 02:41:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001000228] [2025-03-09 02:41:03,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001000228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:41:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745700625] [2025-03-09 02:41:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:41:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:41:03,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:41:03,616 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,708 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2025-03-09 02:41:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:03,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 02:41:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,710 INFO L225 Difference]: With dead ends: 107 [2025-03-09 02:41:03,710 INFO L226 Difference]: Without dead ends: 106 [2025-03-09 02:41:03,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:41:03,711 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 36 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 307 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-09 02:41:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-03-09 02:41:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.36) internal successors, (102), 85 states have internal predecessors, (102), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:41:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2025-03-09 02:41:03,717 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 19 [2025-03-09 02:41:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,717 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2025-03-09 02:41:03,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2025-03-09 02:41:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 02:41:03,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:41:03,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1149929585, now seen corresponding path program 1 times [2025-03-09 02:41:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681624498] [2025-03-09 02:41:03,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:41:03,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:41:03,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,745 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-09 02:41:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681624498] [2025-03-09 02:41:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681624498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340150962] [2025-03-09 02:41:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:03,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:03,746 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 02:41:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,762 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2025-03-09 02:41:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:03,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2025-03-09 02:41:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,763 INFO L225 Difference]: With dead ends: 105 [2025-03-09 02:41:03,763 INFO L226 Difference]: Without dead ends: 104 [2025-03-09 02:41:03,764 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-09 02:41:03,764 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 145 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-09 02:41:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-09 02:41:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 84 states have internal predecessors, (101), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:41:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2025-03-09 02:41:03,774 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 19 [2025-03-09 02:41:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,774 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2025-03-09 02:41:03,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 02:41:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2025-03-09 02:41:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:41:03,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:41:03,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1288078748, now seen corresponding path program 1 times [2025-03-09 02:41:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143659688] [2025-03-09 02:41:03,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:41:03,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:41:03,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,832 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-09 02:41:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143659688] [2025-03-09 02:41:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143659688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:41:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324625914] [2025-03-09 02:41:03,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:41:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:41:03,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:41:03,833 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 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-09 02:41:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,855 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2025-03-09 02:41:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:41:03,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 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 20 [2025-03-09 02:41:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,857 INFO L225 Difference]: With dead ends: 133 [2025-03-09 02:41:03,857 INFO L226 Difference]: Without dead ends: 104 [2025-03-09 02:41:03,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:41:03,858 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-09 02:41:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-09 02:41:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.32) internal successors, (99), 84 states have internal predecessors, (99), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:41:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2025-03-09 02:41:03,864 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 20 [2025-03-09 02:41:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,864 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2025-03-09 02:41:03,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 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-09 02:41:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2025-03-09 02:41:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 02:41:03,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:41:03,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1076653306, now seen corresponding path program 1 times [2025-03-09 02:41:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577808934] [2025-03-09 02:41:03,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:41:03,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:41:03,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,911 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-09 02:41:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577808934] [2025-03-09 02:41:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577808934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224664253] [2025-03-09 02:41:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:03,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:03,913 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 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-09 02:41:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,950 INFO L93 Difference]: Finished difference Result 140 states and 167 transitions. [2025-03-09 02:41:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:03,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 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 21 [2025-03-09 02:41:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,951 INFO L225 Difference]: With dead ends: 140 [2025-03-09 02:41:03,953 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 02:41:03,953 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-09 02:41:03,953 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:03,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 02:41:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2025-03-09 02:41:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 92 states have internal predecessors, (110), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:41:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2025-03-09 02:41:03,965 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 21 [2025-03-09 02:41:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,965 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2025-03-09 02:41:03,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 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-09 02:41:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2025-03-09 02:41:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:41:03,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:41:03,966 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:03,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash 424030597, now seen corresponding path program 1 times [2025-03-09 02:41:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389984167] [2025-03-09 02:41:03,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:41:03,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:41:03,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,003 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-09 02:41:04,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:04,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389984167] [2025-03-09 02:41:04,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389984167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:04,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:04,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635581684] [2025-03-09 02:41:04,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:04,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:04,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:04,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:04,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:04,005 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 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-09 02:41:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:04,058 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2025-03-09 02:41:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:04,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 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 23 [2025-03-09 02:41:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:04,059 INFO L225 Difference]: With dead ends: 137 [2025-03-09 02:41:04,059 INFO L226 Difference]: Without dead ends: 136 [2025-03-09 02:41:04,059 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-09 02:41:04,059 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:04,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 269 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-09 02:41:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2025-03-09 02:41:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 105 states have internal predecessors, (129), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 02:41:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2025-03-09 02:41:04,067 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 23 [2025-03-09 02:41:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:04,067 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2025-03-09 02:41:04,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 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-09 02:41:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2025-03-09 02:41:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:41:04,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:04,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:04,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:41:04,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1206765459, now seen corresponding path program 1 times [2025-03-09 02:41:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211121758] [2025-03-09 02:41:04,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:04,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:41:04,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:41:04,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,131 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-09 02:41:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211121758] [2025-03-09 02:41:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211121758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033369273] [2025-03-09 02:41:04,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:04,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:04,134 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-09 02:41:04,135 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-09 02:41:04,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:41:04,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:41:04,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:41:04,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:04,226 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-09 02:41:04,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:04,323 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-09 02:41:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033369273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:04,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:04,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 02:41:04,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973213938] [2025-03-09 02:41:04,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:04,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:41:04,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:04,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:41:04,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:04,324 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:04,541 INFO L93 Difference]: Finished difference Result 256 states and 321 transitions. [2025-03-09 02:41:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-09 02:41:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:04,544 INFO L225 Difference]: With dead ends: 256 [2025-03-09 02:41:04,544 INFO L226 Difference]: Without dead ends: 148 [2025-03-09 02:41:04,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:41:04,545 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:04,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 594 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:41:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-09 02:41:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2025-03-09 02:41:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.320754716981132) internal successors, (140), 114 states have internal predecessors, (140), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-09 02:41:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2025-03-09 02:41:04,558 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 25 [2025-03-09 02:41:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:04,558 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2025-03-09 02:41:04,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2025-03-09 02:41:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:41:04,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:04,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:04,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:41:04,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 02:41:04,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:04,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1244952621, now seen corresponding path program 1 times [2025-03-09 02:41:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144270495] [2025-03-09 02:41:04,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:04,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:41:04,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:41:04,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 02:41:04,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144270495] [2025-03-09 02:41:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144270495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819460313] [2025-03-09 02:41:04,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:04,836 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-09 02:41:04,838 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-09 02:41:04,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:41:04,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:41:04,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:41:04,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:05,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:05,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819460313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:05,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-03-09 02:41:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285970912] [2025-03-09 02:41:05,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:05,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 02:41:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:05,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 02:41:05,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:41:05,137 INFO L87 Difference]: Start difference. First operand 139 states and 171 transitions. Second operand has 21 states, 20 states have (on average 3.0) internal successors, (60), 13 states have internal predecessors, (60), 8 states have call successors, (9), 8 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:05,590 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2025-03-09 02:41:05,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:41:05,590 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 13 states have internal predecessors, (60), 8 states have call successors, (9), 8 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-09 02:41:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:05,591 INFO L225 Difference]: With dead ends: 172 [2025-03-09 02:41:05,592 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 02:41:05,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:41:05,593 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 188 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:05,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 682 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:41:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 02:41:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 152. [2025-03-09 02:41:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 124 states have internal predecessors, (152), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 02:41:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 187 transitions. [2025-03-09 02:41:05,609 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 187 transitions. Word has length 26 [2025-03-09 02:41:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:05,609 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 187 transitions. [2025-03-09 02:41:05,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.0) internal successors, (60), 13 states have internal predecessors, (60), 8 states have call successors, (9), 8 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2025-03-09 02:41:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:41:05,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:05,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:05,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:05,811 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,SelfDestructingSolverStorable13 [2025-03-09 02:41:05,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:05,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash 61174386, now seen corresponding path program 1 times [2025-03-09 02:41:05,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:05,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870157089] [2025-03-09 02:41:05,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:05,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:05,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:41:05,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:41:05,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:05,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:41:05,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:05,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870157089] [2025-03-09 02:41:05,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870157089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:05,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507316879] [2025-03-09 02:41:05,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:05,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:05,893 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-09 02:41:05,894 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-09 02:41:05,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:41:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:41:05,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:05,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:05,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:41:05,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:06,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507316879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:06,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:06,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-09 02:41:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089082861] [2025-03-09 02:41:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:41:06,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:41:06,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:41:06,074 INFO L87 Difference]: Start difference. First operand 152 states and 187 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,242 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2025-03-09 02:41:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-09 02:41:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,244 INFO L225 Difference]: With dead ends: 179 [2025-03-09 02:41:06,244 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 02:41:06,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:41:06,244 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:06,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 404 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 02:41:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2025-03-09 02:41:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 130 states have (on average 1.2692307692307692) internal successors, (165), 136 states have internal predecessors, (165), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-09 02:41:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2025-03-09 02:41:06,254 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 27 [2025-03-09 02:41:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,254 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2025-03-09 02:41:06,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2025-03-09 02:41:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:41:06,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,255 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,261 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-09 02:41:06,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:06,459 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:06,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1207110322, now seen corresponding path program 1 times [2025-03-09 02:41:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067293274] [2025-03-09 02:41:06,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:41:06,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:41:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:06,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067293274] [2025-03-09 02:41:06,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067293274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:06,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:06,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279635036] [2025-03-09 02:41:06,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:06,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:06,486 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:41:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,545 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2025-03-09 02:41:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:06,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-09 02:41:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,547 INFO L225 Difference]: With dead ends: 197 [2025-03-09 02:41:06,547 INFO L226 Difference]: Without dead ends: 195 [2025-03-09 02:41:06,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:41:06,547 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 28 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:06,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 258 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-09 02:41:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2025-03-09 02:41:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.2657342657342658) internal successors, (181), 148 states have internal predecessors, (181), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-09 02:41:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2025-03-09 02:41:06,562 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 28 [2025-03-09 02:41:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,562 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2025-03-09 02:41:06,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:41:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2025-03-09 02:41:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:41:06,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:41:06,564 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -715105063, now seen corresponding path program 1 times [2025-03-09 02:41:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784914823] [2025-03-09 02:41:06,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:41:06,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:41:06,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:41:06,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784914823] [2025-03-09 02:41:06,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784914823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568475816] [2025-03-09 02:41:06,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:06,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:06,642 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-09 02:41:06,643 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-09 02:41:06,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:41:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:41:06,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:41:06,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:06,718 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-09 02:41:06,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:06,786 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-09 02:41:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568475816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:06,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:06,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2025-03-09 02:41:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513265265] [2025-03-09 02:41:06,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:41:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:41:06,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:41:06,788 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:41:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,978 INFO L93 Difference]: Finished difference Result 231 states and 299 transitions. [2025-03-09 02:41:06,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:41:06,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2025-03-09 02:41:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,980 INFO L225 Difference]: With dead ends: 231 [2025-03-09 02:41:06,980 INFO L226 Difference]: Without dead ends: 180 [2025-03-09 02:41:06,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:41:06,980 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 95 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:06,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 662 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-09 02:41:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2025-03-09 02:41:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 139 states have internal predecessors, (163), 20 states have call successors, (20), 12 states have call predecessors, (20), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 02:41:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2025-03-09 02:41:06,989 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 31 [2025-03-09 02:41:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,989 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2025-03-09 02:41:06,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:41:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2025-03-09 02:41:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:41:06,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,990 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:06,995 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-09 02:41:07,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:41:07,194 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -45345625, now seen corresponding path program 1 times [2025-03-09 02:41:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168462349] [2025-03-09 02:41:07,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:07,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:41:07,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:07,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:07,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:07,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:07,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168462349] [2025-03-09 02:41:07,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168462349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311449362] [2025-03-09 02:41:07,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:07,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:07,262 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-09 02:41:07,263 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-09 02:41:07,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:41:07,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:07,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:07,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:07,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:41:07,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:41:07,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311449362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:07,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:07,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-09 02:41:07,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891970470] [2025-03-09 02:41:07,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:07,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:41:07,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:07,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:41:07,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:41:07,360 INFO L87 Difference]: Start difference. First operand 169 states and 201 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:41:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:07,414 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2025-03-09 02:41:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:41:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-03-09 02:41:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:07,415 INFO L225 Difference]: With dead ends: 176 [2025-03-09 02:41:07,416 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 02:41:07,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:41:07,417 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:07,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 02:41:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2025-03-09 02:41:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.1842105263157894) internal successors, (135), 116 states have internal predecessors, (135), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-09 02:41:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2025-03-09 02:41:07,425 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 33 [2025-03-09 02:41:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:07,426 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2025-03-09 02:41:07,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 6 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:41:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2025-03-09 02:41:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:41:07,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:07,426 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:07,432 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-09 02:41:07,629 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,SelfDestructingSolverStorable17 [2025-03-09 02:41:07,629 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:07,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1714744656, now seen corresponding path program 2 times [2025-03-09 02:41:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:07,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230937077] [2025-03-09 02:41:07,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:07,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 02:41:07,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:07,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:07,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230937077] [2025-03-09 02:41:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230937077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410326493] [2025-03-09 02:41:07,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:07,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:07,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:07,764 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-09 02:41:07,766 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-09 02:41:07,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-09 02:41:07,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:07,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:07,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:07,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 02:41:07,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:07,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410326493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:08,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:08,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-03-09 02:41:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217799264] [2025-03-09 02:41:08,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:41:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:41:08,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:41:08,165 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 17 states have internal predecessors, (80), 11 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:09,906 INFO L93 Difference]: Finished difference Result 405 states and 509 transitions. [2025-03-09 02:41:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-09 02:41:09,907 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 17 states have internal predecessors, (80), 11 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-09 02:41:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:09,909 INFO L225 Difference]: With dead ends: 405 [2025-03-09 02:41:09,909 INFO L226 Difference]: Without dead ends: 404 [2025-03-09 02:41:09,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1093, Invalid=6217, Unknown=0, NotChecked=0, Total=7310 [2025-03-09 02:41:09,911 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1123 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:09,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 771 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:41:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-09 02:41:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 323. [2025-03-09 02:41:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.2131782945736433) internal successors, (313), 260 states have internal predecessors, (313), 41 states have call successors, (41), 22 states have call predecessors, (41), 21 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-09 02:41:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2025-03-09 02:41:09,945 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 33 [2025-03-09 02:41:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:09,945 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2025-03-09 02:41:09,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.857142857142857) internal successors, (80), 17 states have internal predecessors, (80), 11 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2025-03-09 02:41:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:41:09,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:09,946 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:09,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:41:10,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:10,146 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:10,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 407109072, now seen corresponding path program 1 times [2025-03-09 02:41:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775017552] [2025-03-09 02:41:10,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:10,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:41:10,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:10,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:10,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:10,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775017552] [2025-03-09 02:41:10,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775017552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:10,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643140707] [2025-03-09 02:41:10,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:10,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:10,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:10,204 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-09 02:41:10,206 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-09 02:41:10,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:41:10,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:41:10,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:10,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:10,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:10,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:10,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:10,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643140707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:10,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:10,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 02:41:10,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973157854] [2025-03-09 02:41:10,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:10,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:41:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:10,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:41:10,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:41:10,342 INFO L87 Difference]: Start difference. First operand 323 states and 394 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:41:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:10,398 INFO L93 Difference]: Finished difference Result 332 states and 404 transitions. [2025-03-09 02:41:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:41:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2025-03-09 02:41:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:10,400 INFO L225 Difference]: With dead ends: 332 [2025-03-09 02:41:10,400 INFO L226 Difference]: Without dead ends: 328 [2025-03-09 02:41:10,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:41:10,402 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:10,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 464 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-09 02:41:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-09 02:41:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 262 states have (on average 1.2099236641221374) internal successors, (317), 264 states have internal predecessors, (317), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (41), 41 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-09 02:41:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 399 transitions. [2025-03-09 02:41:10,439 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 399 transitions. Word has length 33 [2025-03-09 02:41:10,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:10,439 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 399 transitions. [2025-03-09 02:41:10,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:41:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 399 transitions. [2025-03-09 02:41:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 02:41:10,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:10,440 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:10,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:10,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:10,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:10,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1916225099, now seen corresponding path program 1 times [2025-03-09 02:41:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:10,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302776535] [2025-03-09 02:41:10,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:10,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 02:41:10,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 02:41:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 02:41:10,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:10,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302776535] [2025-03-09 02:41:10,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302776535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:10,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215721918] [2025-03-09 02:41:10,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:10,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:10,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:10,704 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-09 02:41:10,705 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-09 02:41:10,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 02:41:10,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 02:41:10,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:10,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:10,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:41:10,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 02:41:10,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:10,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215721918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:10,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-03-09 02:41:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999992929] [2025-03-09 02:41:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:41:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:10,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:41:10,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:41:10,817 INFO L87 Difference]: Start difference. First operand 328 states and 399 transitions. Second operand has 8 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (4), 3 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-09 02:41:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:10,956 INFO L93 Difference]: Finished difference Result 366 states and 455 transitions. [2025-03-09 02:41:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:41:10,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (4), 3 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 41 [2025-03-09 02:41:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:10,958 INFO L225 Difference]: With dead ends: 366 [2025-03-09 02:41:10,958 INFO L226 Difference]: Without dead ends: 365 [2025-03-09 02:41:10,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:41:10,959 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:10,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 310 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-09 02:41:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 327. [2025-03-09 02:41:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 262 states have (on average 1.1603053435114503) internal successors, (304), 263 states have internal predecessors, (304), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (41), 41 states have call predecessors, (41), 40 states have call successors, (41) [2025-03-09 02:41:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 386 transitions. [2025-03-09 02:41:10,984 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 386 transitions. Word has length 41 [2025-03-09 02:41:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:10,984 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 386 transitions. [2025-03-09 02:41:10,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (4), 3 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-09 02:41:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 386 transitions. [2025-03-09 02:41:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:41:10,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:10,985 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:10,991 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-09 02:41:11,185 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,SelfDestructingSolverStorable20 [2025-03-09 02:41:11,186 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:11,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1947977286, now seen corresponding path program 1 times [2025-03-09 02:41:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:11,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310473482] [2025-03-09 02:41:11,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:11,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:11,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:41:11,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:41:11,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:11,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:41:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310473482] [2025-03-09 02:41:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310473482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492207437] [2025-03-09 02:41:11,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:11,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:11,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:11,270 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-09 02:41:11,271 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-09 02:41:11,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:41:11,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:41:11,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:11,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:11,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:41:11,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 02:41:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492207437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:11,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-09 02:41:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130403132] [2025-03-09 02:41:11,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:41:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:41:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:41:11,535 INFO L87 Difference]: Start difference. First operand 327 states and 386 transitions. Second operand has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 02:41:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:11,661 INFO L93 Difference]: Finished difference Result 344 states and 406 transitions. [2025-03-09 02:41:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:41:11,661 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 45 [2025-03-09 02:41:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:11,663 INFO L225 Difference]: With dead ends: 344 [2025-03-09 02:41:11,663 INFO L226 Difference]: Without dead ends: 337 [2025-03-09 02:41:11,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:41:11,664 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:11,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 628 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-09 02:41:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-09 02:41:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 270 states have (on average 1.1555555555555554) internal successors, (312), 271 states have internal predecessors, (312), 41 states have call successors, (41), 22 states have call predecessors, (41), 24 states have return successors, (43), 43 states have call predecessors, (43), 40 states have call successors, (43) [2025-03-09 02:41:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 396 transitions. [2025-03-09 02:41:11,681 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 396 transitions. Word has length 45 [2025-03-09 02:41:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 396 transitions. [2025-03-09 02:41:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 18 states have internal predecessors, (68), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 02:41:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 396 transitions. [2025-03-09 02:41:11,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:41:11,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:11,682 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:11,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:41:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:11,883 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:11,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1253177025, now seen corresponding path program 1 times [2025-03-09 02:41:11,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:11,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768004959] [2025-03-09 02:41:11,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:11,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:11,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:41:11,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:41:11,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:11,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768004959] [2025-03-09 02:41:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768004959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:12,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709190218] [2025-03-09 02:41:12,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:12,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:12,121 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-09 02:41:12,123 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-09 02:41:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:41:12,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:41:12,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:12,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:41:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 02:41:12,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:41:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709190218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:12,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:41:12,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2025-03-09 02:41:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171466250] [2025-03-09 02:41:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:12,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:12,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:12,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:41:12,208 INFO L87 Difference]: Start difference. First operand 337 states and 396 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:12,259 INFO L93 Difference]: Finished difference Result 581 states and 703 transitions. [2025-03-09 02:41:12,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:12,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-09 02:41:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:12,261 INFO L225 Difference]: With dead ends: 581 [2025-03-09 02:41:12,261 INFO L226 Difference]: Without dead ends: 264 [2025-03-09 02:41:12,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2025-03-09 02:41:12,263 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 18 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:12,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 247 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-09 02:41:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2025-03-09 02:41:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 201 states have (on average 1.1243781094527363) internal successors, (226), 202 states have internal predecessors, (226), 28 states have call successors, (28), 17 states have call predecessors, (28), 19 states have return successors, (30), 30 states have call predecessors, (30), 27 states have call successors, (30) [2025-03-09 02:41:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 284 transitions. [2025-03-09 02:41:12,276 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 284 transitions. Word has length 59 [2025-03-09 02:41:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:12,276 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 284 transitions. [2025-03-09 02:41:12,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 284 transitions. [2025-03-09 02:41:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 02:41:12,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:12,277 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:12,283 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-09 02:41:12,478 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,SelfDestructingSolverStorable22 [2025-03-09 02:41:12,478 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:12,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash 869821702, now seen corresponding path program 2 times [2025-03-09 02:41:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383401550] [2025-03-09 02:41:12,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:12,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-09 02:41:12,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:41:12,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:12,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 02:41:12,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383401550] [2025-03-09 02:41:12,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383401550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273360433] [2025-03-09 02:41:12,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:12,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:12,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:12,696 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-09 02:41:12,697 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-09 02:41:12,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-09 02:41:12,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:41:12,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:12,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:41:12,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:12,910 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 02:41:12,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 02:41:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273360433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:13,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:13,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 31 [2025-03-09 02:41:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247221649] [2025-03-09 02:41:13,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 02:41:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:13,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 02:41:13,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:41:13,547 INFO L87 Difference]: Start difference. First operand 250 states and 284 transitions. Second operand has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 30 states have internal predecessors, (102), 9 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:41:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:13,854 INFO L93 Difference]: Finished difference Result 283 states and 324 transitions. [2025-03-09 02:41:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 02:41:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 30 states have internal predecessors, (102), 9 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 7 states have call successors, (13) Word has length 83 [2025-03-09 02:41:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:13,856 INFO L225 Difference]: With dead ends: 283 [2025-03-09 02:41:13,856 INFO L226 Difference]: Without dead ends: 270 [2025-03-09 02:41:13,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=1815, Unknown=0, NotChecked=0, Total=2162 [2025-03-09 02:41:13,857 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 118 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:13,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 823 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:41:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-09 02:41:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-09 02:41:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 217 states have (on average 1.1152073732718895) internal successors, (242), 218 states have internal predecessors, (242), 28 states have call successors, (28), 17 states have call predecessors, (28), 23 states have return successors, (34), 34 states have call predecessors, (34), 27 states have call successors, (34) [2025-03-09 02:41:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 304 transitions. [2025-03-09 02:41:13,871 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 304 transitions. Word has length 83 [2025-03-09 02:41:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:13,871 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 304 transitions. [2025-03-09 02:41:13,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 30 states have internal predecessors, (102), 9 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (13), 13 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-09 02:41:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 304 transitions. [2025-03-09 02:41:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 02:41:13,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:13,872 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:13,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:14,076 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,SelfDestructingSolverStorable23 [2025-03-09 02:41:14,076 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1271196347, now seen corresponding path program 2 times [2025-03-09 02:41:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:14,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909219833] [2025-03-09 02:41:14,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:14,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 02:41:14,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 02:41:14,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:14,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 02:41:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909219833] [2025-03-09 02:41:14,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909219833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:14,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100162097] [2025-03-09 02:41:14,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:14,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:14,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:14,281 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-09 02:41:14,282 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-09 02:41:14,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-09 02:41:14,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 02:41:14,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:14,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:14,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 02:41:14,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 47 proven. 30 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-09 02:41:14,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-09 02:41:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100162097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:14,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-09 02:41:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940566714] [2025-03-09 02:41:14,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:14,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 02:41:14,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:14,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 02:41:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 02:41:14,751 INFO L87 Difference]: Start difference. First operand 270 states and 304 transitions. Second operand has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 20 states have internal predecessors, (108), 17 states have call successors, (19), 14 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:16,558 INFO L93 Difference]: Finished difference Result 639 states and 742 transitions. [2025-03-09 02:41:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-09 02:41:16,559 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 20 states have internal predecessors, (108), 17 states have call successors, (19), 14 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-09 02:41:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:16,561 INFO L225 Difference]: With dead ends: 639 [2025-03-09 02:41:16,561 INFO L226 Difference]: Without dead ends: 638 [2025-03-09 02:41:16,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1491, Invalid=6881, Unknown=0, NotChecked=0, Total=8372 [2025-03-09 02:41:16,563 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 627 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:16,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1039 Invalid, 1888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:41:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-09 02:41:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 552. [2025-03-09 02:41:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 445 states have (on average 1.1123595505617978) internal successors, (495), 445 states have internal predecessors, (495), 62 states have call successors, (62), 38 states have call predecessors, (62), 44 states have return successors, (68), 68 states have call predecessors, (68), 61 states have call successors, (68) [2025-03-09 02:41:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 625 transitions. [2025-03-09 02:41:16,601 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 625 transitions. Word has length 75 [2025-03-09 02:41:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:16,601 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 625 transitions. [2025-03-09 02:41:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 20 states have internal predecessors, (108), 17 states have call successors, (19), 14 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 625 transitions. [2025-03-09 02:41:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-09 02:41:16,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:16,603 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:16,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:16,803 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,SelfDestructingSolverStorable24 [2025-03-09 02:41:16,804 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:16,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2126232966, now seen corresponding path program 3 times [2025-03-09 02:41:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600764591] [2025-03-09 02:41:16,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:16,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 11 equivalence classes. [2025-03-09 02:41:16,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 131 statements. [2025-03-09 02:41:16,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:41:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-09 02:41:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600764591] [2025-03-09 02:41:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600764591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759431424] [2025-03-09 02:41:17,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:17,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:17,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:17,271 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-09 02:41:17,271 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-09 02:41:17,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 11 equivalence classes. [2025-03-09 02:41:17,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 131 statements. [2025-03-09 02:41:17,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:41:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:17,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 02:41:17,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-09 02:41:17,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 30 proven. 356 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-09 02:41:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759431424] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:20,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 23] total 55 [2025-03-09 02:41:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836855968] [2025-03-09 02:41:20,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:20,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-09 02:41:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:20,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-09 02:41:20,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2675, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 02:41:20,841 INFO L87 Difference]: Start difference. First operand 552 states and 625 transitions. Second operand has 56 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 54 states have internal predecessors, (155), 10 states have call successors, (12), 3 states have call predecessors, (12), 20 states have return successors, (25), 25 states have call predecessors, (25), 8 states have call successors, (25) [2025-03-09 02:41:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:21,827 INFO L93 Difference]: Finished difference Result 641 states and 735 transitions. [2025-03-09 02:41:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-09 02:41:21,828 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 54 states have internal predecessors, (155), 10 states have call successors, (12), 3 states have call predecessors, (12), 20 states have return successors, (25), 25 states have call predecessors, (25), 8 states have call successors, (25) Word has length 131 [2025-03-09 02:41:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:21,830 INFO L225 Difference]: With dead ends: 641 [2025-03-09 02:41:21,830 INFO L226 Difference]: Without dead ends: 607 [2025-03-09 02:41:21,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2274 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1279, Invalid=7277, Unknown=0, NotChecked=0, Total=8556 [2025-03-09 02:41:21,834 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 224 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:21,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1497 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:41:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-09 02:41:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-09 02:41:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 489 states have (on average 1.1022494887525562) internal successors, (539), 489 states have internal predecessors, (539), 62 states have call successors, (62), 38 states have call predecessors, (62), 55 states have return successors, (79), 79 states have call predecessors, (79), 61 states have call successors, (79) [2025-03-09 02:41:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 680 transitions. [2025-03-09 02:41:21,867 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 680 transitions. Word has length 131 [2025-03-09 02:41:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:21,867 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 680 transitions. [2025-03-09 02:41:21,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 54 states have internal predecessors, (155), 10 states have call successors, (12), 3 states have call predecessors, (12), 20 states have return successors, (25), 25 states have call predecessors, (25), 8 states have call successors, (25) [2025-03-09 02:41:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 680 transitions. [2025-03-09 02:41:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-09 02:41:21,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:21,870 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:21,879 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-09 02:41:22,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 02:41:22,075 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:41:22,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 572710416, now seen corresponding path program 4 times [2025-03-09 02:41:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284185336] [2025-03-09 02:41:22,076 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:22,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:22,087 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 263 statements into 2 equivalence classes. [2025-03-09 02:41:22,100 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 263 of 263 statements. [2025-03-09 02:41:22,100 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:22,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2409 backedges. 0 proven. 1299 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2025-03-09 02:41:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284185336] [2025-03-09 02:41:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284185336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391950205] [2025-03-09 02:41:24,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:24,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:24,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:24,418 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-09 02:41:24,420 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-09 02:41:24,490 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 263 statements into 2 equivalence classes. [2025-03-09 02:41:24,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 263 of 263 statements. [2025-03-09 02:41:24,534 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:24,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:24,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-09 02:41:24,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2409 backedges. 0 proven. 1299 refuted. 0 times theorem prover too weak. 1110 trivial. 0 not checked. [2025-03-09 02:41:25,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2409 backedges. 0 proven. 1401 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2025-03-09 02:42:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391950205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:22,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 44] total 105 [2025-03-09 02:42:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574099893] [2025-03-09 02:42:22,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:22,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2025-03-09 02:42:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:22,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2025-03-09 02:42:22,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1246, Invalid=9884, Unknown=0, NotChecked=0, Total=11130 [2025-03-09 02:42:22,477 INFO L87 Difference]: Start difference. First operand 607 states and 680 transitions. Second operand has 106 states, 105 states have (on average 2.5238095238095237) internal successors, (265), 104 states have internal predecessors, (265), 9 states have call successors, (11), 3 states have call predecessors, (11), 38 states have return successors, (58), 58 states have call predecessors, (58), 7 states have call successors, (58) [2025-03-09 02:42:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:42:25,372 INFO L93 Difference]: Finished difference Result 760 states and 870 transitions. [2025-03-09 02:42:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-09 02:42:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 2.5238095238095237) internal successors, (265), 104 states have internal predecessors, (265), 9 states have call successors, (11), 3 states have call predecessors, (11), 38 states have return successors, (58), 58 states have call predecessors, (58), 7 states have call successors, (58) Word has length 263 [2025-03-09 02:42:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:42:25,375 INFO L225 Difference]: With dead ends: 760 [2025-03-09 02:42:25,375 INFO L226 Difference]: Without dead ends: 702 [2025-03-09 02:42:25,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9954 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3928, Invalid=28652, Unknown=0, NotChecked=0, Total=32580 [2025-03-09 02:42:25,380 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 556 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 2915 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:42:25,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1915 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2915 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 02:42:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-09 02:42:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-03-09 02:42:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 565 states have (on average 1.0884955752212389) internal successors, (615), 565 states have internal predecessors, (615), 62 states have call successors, (62), 38 states have call predecessors, (62), 74 states have return successors, (98), 98 states have call predecessors, (98), 61 states have call successors, (98) [2025-03-09 02:42:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 775 transitions. [2025-03-09 02:42:25,415 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 775 transitions. Word has length 263 [2025-03-09 02:42:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:42:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 775 transitions. [2025-03-09 02:42:25,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 2.5238095238095237) internal successors, (265), 104 states have internal predecessors, (265), 9 states have call successors, (11), 3 states have call predecessors, (11), 38 states have return successors, (58), 58 states have call predecessors, (58), 7 states have call successors, (58) [2025-03-09 02:42:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 775 transitions. [2025-03-09 02:42:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-09 02:42:25,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:42:25,421 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 38, 38, 38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:42:25,428 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-09 02:42:25,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:25,622 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multiple_ofErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multiple_ofErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 02:42:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:42:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1022755142, now seen corresponding path program 5 times [2025-03-09 02:42:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:42:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943757699] [2025-03-09 02:42:25,623 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:42:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:42:25,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 491 statements into 41 equivalence classes. [2025-03-09 02:42:25,867 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) and asserted 491 of 491 statements. [2025-03-09 02:42:25,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2025-03-09 02:42:25,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat