./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 11:28:23,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:23,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:28:23,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:23,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:23,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:23,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:23,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:23,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:23,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:23,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:23,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:23,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:23,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:23,643 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:23,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:23,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:23,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:23,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:23,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:23,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:23,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:23,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:23,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:23,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:23,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:23,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:23,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:23,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:23,647 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-04 11:28:23,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:23,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:23,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:23,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:23,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:23,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2025-03-04 11:28:24,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a622d814e/6e77f39f1f7545448b34e553a688a519/FLAG7fffebf02 [2025-03-04 11:28:25,171 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:25,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2025-03-04 11:28:25,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a622d814e/6e77f39f1f7545448b34e553a688a519/FLAG7fffebf02 [2025-03-04 11:28:25,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a622d814e/6e77f39f1f7545448b34e553a688a519 [2025-03-04 11:28:25,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:25,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:25,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:25,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:25,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:25,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25, skipping insertion in model container [2025-03-04 11:28:25,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:25,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:25,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:25,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:25,367 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:25,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25 WrapperNode [2025-03-04 11:28:25,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:25,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:25,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:25,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:25,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,396 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-03-04 11:28:25,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:25,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:25,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:25,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:25,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,420 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-04 11:28:25,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:25,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:25,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:25,431 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:25,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (1/1) ... [2025-03-04 11:28:25,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:25,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:25,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:28:25,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:28:25,481 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2025-03-04 11:28:25,482 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2025-03-04 11:28:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-04 11:28:25,482 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-04 11:28:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2025-03-04 11:28:25,482 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2025-03-04 11:28:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:25,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:25,524 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:25,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:25,592 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: havoc #t~ret6; [2025-03-04 11:28:25,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc #t~ret8; [2025-03-04 11:28:25,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc #t~ret7; [2025-03-04 11:28:25,615 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc #t~ret5; [2025-03-04 11:28:25,616 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-04 11:28:25,653 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc is_prime_#t~ret9#1; [2025-03-04 11:28:25,682 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret11; [2025-03-04 11:28:25,703 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:25,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:25,711 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:25,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:25,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:25 BoogieIcfgContainer [2025-03-04 11:28:25,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:25,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:25,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:25,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:25,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:25" (1/3) ... [2025-03-04 11:28:25,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7317c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:25, skipping insertion in model container [2025-03-04 11:28:25,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:25" (2/3) ... [2025-03-04 11:28:25,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7317c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:25, skipping insertion in model container [2025-03-04 11:28:25,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:25" (3/3) ... [2025-03-04 11:28:25,720 INFO L128 eAbstractionObserver]: Analyzing ICFG Primes.c [2025-03-04 11:28:25,729 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:25,730 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-04 11:28:25,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:25,784 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;@4f3de4af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:25,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 11:28:25,788 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-04 11:28:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 11:28:25,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:25,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 11:28:25,794 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-04 11:28:25,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 3754619, now seen corresponding path program 1 times [2025-03-04 11:28:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:25,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813446530] [2025-03-04 11:28:25,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:25,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 11:28:25,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 11:28:25,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:25,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:25,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813446530] [2025-03-04 11:28:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813446530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:25,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788808978] [2025-03-04 11:28:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:25,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:25,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:25,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:25,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:25,946 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-04 11:28:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:25,977 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2025-03-04 11:28:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:25,979 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-04 11:28:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:25,983 INFO L225 Difference]: With dead ends: 87 [2025-03-04 11:28:25,984 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:28:25,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:25,988 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-04 11:28:25,988 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-04 11:28:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:28:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 11:28:26,021 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-04 11:28:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2025-03-04 11:28:26,027 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 4 [2025-03-04 11:28:26,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,027 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2025-03-04 11:28:26,027 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-04 11:28:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2025-03-04 11:28:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:28:26,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:28:26,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:26,028 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-04 11:28:26,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 116393241, now seen corresponding path program 1 times [2025-03-04 11:28:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587284337] [2025-03-04 11:28:26,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:28:26,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:28:26,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587284337] [2025-03-04 11:28:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587284337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453954236] [2025-03-04 11:28:26,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:26,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:26,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,077 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-04 11:28:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,095 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-03-04 11:28:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 11:28:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,097 INFO L225 Difference]: With dead ends: 76 [2025-03-04 11:28:26,097 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 11:28:26,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,099 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-04 11:28:26,099 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-04 11:28:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 11:28:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 11:28:26,103 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-04 11:28:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2025-03-04 11:28:26,105 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 5 [2025-03-04 11:28:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,106 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2025-03-04 11:28:26,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2025-03-04 11:28:26,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:28:26,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:26,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:26,107 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-04 11:28:26,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash 345767712, now seen corresponding path program 1 times [2025-03-04 11:28:26,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297459240] [2025-03-04 11:28:26,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:28:26,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:28:26,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:26,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297459240] [2025-03-04 11:28:26,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297459240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149833798] [2025-03-04 11:28:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:26,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,152 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-04 11:28:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,176 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2025-03-04 11:28:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:26,176 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-04 11:28:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,180 INFO L225 Difference]: With dead ends: 77 [2025-03-04 11:28:26,181 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:28:26,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,182 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-04 11:28:26,182 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-04 11:28:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:28:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2025-03-04 11:28:26,192 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-04 11:28:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2025-03-04 11:28:26,193 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 15 [2025-03-04 11:28:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,193 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2025-03-04 11:28:26,193 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-04 11:28:26,193 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2025-03-04 11:28:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:28:26,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:26,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:28:26,194 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-04 11:28:26,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2128864473, now seen corresponding path program 1 times [2025-03-04 11:28:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601149922] [2025-03-04 11:28:26,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:28:26,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:28:26,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:26,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601149922] [2025-03-04 11:28:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601149922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224878919] [2025-03-04 11:28:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:26,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:26,266 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-04 11:28:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,327 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2025-03-04 11:28:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:26,328 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-04 11:28:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,328 INFO L225 Difference]: With dead ends: 138 [2025-03-04 11:28:26,328 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 11:28:26,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:26,329 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-04 11:28:26,329 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-04 11:28:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 11:28:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-04 11:28:26,344 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-04 11:28:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-04 11:28:26,345 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 16 [2025-03-04 11:28:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,345 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-04 11:28:26,345 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-04 11:28:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-04 11:28:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:28:26,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:26,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:28:26,346 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-04 11:28:26,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2128865210, now seen corresponding path program 1 times [2025-03-04 11:28:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27854441] [2025-03-04 11:28:26,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:28:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:28:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27854441] [2025-03-04 11:28:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27854441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:26,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637036280] [2025-03-04 11:28:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:26,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,375 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-04 11:28:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,393 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-03-04 11:28:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:26,393 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-04 11:28:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,394 INFO L225 Difference]: With dead ends: 70 [2025-03-04 11:28:26,395 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 11:28:26,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,395 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-04 11:28:26,397 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-04 11:28:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 11:28:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-04 11:28:26,404 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-04 11:28:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-04 11:28:26,405 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 16 [2025-03-04 11:28:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,405 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-04 11:28:26,405 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-04 11:28:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-04 11:28:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 11:28:26,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:28:26,407 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-04 11:28:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1570312054, now seen corresponding path program 1 times [2025-03-04 11:28:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-04 11:28:26,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 11:28:26,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 11:28:26,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-04 11:28:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145625381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539948949] [2025-03-04 11:28:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:26,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:26,474 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-04 11:28:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,541 INFO L93 Difference]: Finished difference Result 143 states and 176 transitions. [2025-03-04 11:28:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:26,541 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-04 11:28:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,542 INFO L225 Difference]: With dead ends: 143 [2025-03-04 11:28:26,542 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 11:28:26,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:26,543 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:26,543 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.1s Time] [2025-03-04 11:28:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 11:28:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-03-04 11:28:26,548 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-04 11:28:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2025-03-04 11:28:26,548 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 17 [2025-03-04 11:28:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,552 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2025-03-04 11:28:26,552 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-04 11:28:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2025-03-04 11:28:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:28:26,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,553 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-04 11:28:26,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:28:26,553 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-04 11:28:26,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1435057232, now seen corresponding path program 1 times [2025-03-04 11:28:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-03-04 11:28:26,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:28:26,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:28:26,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-03-04 11:28:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165268924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:28:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307954888] [2025-03-04 11:28:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:26,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:26,624 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-04 11:28:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,718 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2025-03-04 11:28:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:26,719 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-04 11:28:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,719 INFO L225 Difference]: With dead ends: 82 [2025-03-04 11:28:26,720 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 11:28:26,720 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-04 11:28:26,721 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-04 11:28:26,721 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-04 11:28:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 11:28:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-04 11:28:26,730 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-04 11:28:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2025-03-04 11:28:26,732 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 18 [2025-03-04 11:28:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,732 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2025-03-04 11:28:26,732 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-04 11:28:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2025-03-04 11:28:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:28:26,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,733 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-04 11:28:26,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:28:26,733 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-04 11:28:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1537101205, now seen corresponding path program 1 times [2025-03-04 11:28:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632714777] [2025-03-04 11:28:26,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:28:26,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:28:26,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,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-04 11:28:26,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632714777] [2025-03-04 11:28:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632714777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:28:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284527676] [2025-03-04 11:28:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:28:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:28:26,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:26,833 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-04 11:28:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,934 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2025-03-04 11:28:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:26,934 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-04 11:28:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,935 INFO L225 Difference]: With dead ends: 107 [2025-03-04 11:28:26,935 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 11:28:26,935 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-04 11:28:26,935 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-04 11:28:26,937 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-04 11:28:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 11:28:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2025-03-04 11:28:26,946 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-04 11:28:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2025-03-04 11:28:26,947 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 19 [2025-03-04 11:28:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,947 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2025-03-04 11:28:26,947 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-04 11:28:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2025-03-04 11:28:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:28:26,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,948 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-04 11:28:26,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:28:26,948 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-04 11:28:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1149929585, now seen corresponding path program 1 times [2025-03-04 11:28:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052465258] [2025-03-04 11:28:26,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:28:26,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:28:26,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052465258] [2025-03-04 11:28:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052465258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:26,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:26,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365359354] [2025-03-04 11:28:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:26,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,978 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-04 11:28:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,994 INFO L93 Difference]: Finished difference Result 105 states and 128 transitions. [2025-03-04 11:28:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:26,995 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-04 11:28:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,996 INFO L225 Difference]: With dead ends: 105 [2025-03-04 11:28:26,996 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:28:26,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:26,997 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-04 11:28:26,997 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-04 11:28:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:28:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-04 11:28:27,006 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-04 11:28:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2025-03-04 11:28:27,008 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 19 [2025-03-04 11:28:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:27,008 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2025-03-04 11:28:27,008 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-04 11:28:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2025-03-04 11:28:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:28:27,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:27,027 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-04 11:28:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:28:27,027 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-04 11:28:27,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1288078748, now seen corresponding path program 1 times [2025-03-04 11:28:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:27,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794686118] [2025-03-04 11:28:27,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:27,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:28:27,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:28:27,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:27,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794686118] [2025-03-04 11:28:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794686118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:28:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801931812] [2025-03-04 11:28:27,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:27,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:28:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:27,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:28:27,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:28:27,092 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-04 11:28:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:27,122 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2025-03-04 11:28:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:28:27,122 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-04 11:28:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:27,123 INFO L225 Difference]: With dead ends: 133 [2025-03-04 11:28:27,123 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:28:27,124 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-04 11:28:27,126 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-04 11:28:27,126 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-04 11:28:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:28:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-04 11:28:27,135 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-04 11:28:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2025-03-04 11:28:27,138 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 20 [2025-03-04 11:28:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:27,138 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2025-03-04 11:28:27,138 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-04 11:28:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2025-03-04 11:28:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 11:28:27,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:27,139 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-04 11:28:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:28:27,139 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-04 11:28:27,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1076653306, now seen corresponding path program 1 times [2025-03-04 11:28:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:27,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-03-04 11:28:27,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:27,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 11:28:27,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 11:28:27,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:27,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:27,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:27,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-03-04 11:28:27,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050576505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:27,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:27,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:27,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941085293] [2025-03-04 11:28:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:27,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:27,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:27,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:27,181 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-04 11:28:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:27,222 INFO L93 Difference]: Finished difference Result 140 states and 167 transitions. [2025-03-04 11:28:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:27,223 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-04 11:28:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:27,225 INFO L225 Difference]: With dead ends: 140 [2025-03-04 11:28:27,225 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 11:28:27,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:27,226 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-04 11:28:27,227 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-04 11:28:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 11:28:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2025-03-04 11:28:27,232 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-04 11:28:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2025-03-04 11:28:27,233 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 21 [2025-03-04 11:28:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:27,233 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2025-03-04 11:28:27,234 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-04 11:28:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2025-03-04 11:28:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:28:27,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:27,234 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-04 11:28:27,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:28:27,234 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-04 11:28:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 424030597, now seen corresponding path program 1 times [2025-03-04 11:28:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520905348] [2025-03-04 11:28:27,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:27,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:28:27,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:28:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:27,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520905348] [2025-03-04 11:28:27,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520905348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:27,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:27,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115974940] [2025-03-04 11:28:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:27,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:27,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:27,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:27,286 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-04 11:28:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:27,340 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2025-03-04 11:28:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:27,341 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-04 11:28:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:27,342 INFO L225 Difference]: With dead ends: 137 [2025-03-04 11:28:27,342 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 11:28:27,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:28:27,343 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-04 11:28:27,343 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-04 11:28:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 11:28:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2025-03-04 11:28:27,349 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-04 11:28:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2025-03-04 11:28:27,350 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 23 [2025-03-04 11:28:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:27,350 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2025-03-04 11:28:27,350 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-04 11:28:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2025-03-04 11:28:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:28:27,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:27,351 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-04 11:28:27,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:28:27,351 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-04 11:28:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1206765459, now seen corresponding path program 1 times [2025-03-04 11:28:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026324952] [2025-03-04 11:28:27,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:28:27,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:28:27,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:27,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026324952] [2025-03-04 11:28:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026324952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230984181] [2025-03-04 11:28:27,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:27,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:27,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:28:27,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:28:27,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:28:27,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:27,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:27,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:28:27,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:27,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:27,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230984181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:27,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:27,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 11:28:27,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858788656] [2025-03-04 11:28:27,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:27,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:28:27,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:27,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:28:27,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:28:27,615 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-04 11:28:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:27,834 INFO L93 Difference]: Finished difference Result 256 states and 321 transitions. [2025-03-04 11:28:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:27,834 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-04 11:28:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:27,835 INFO L225 Difference]: With dead ends: 256 [2025-03-04 11:28:27,835 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:28:27,836 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-04 11:28:27,836 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-04 11:28:27,836 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-04 11:28:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:28:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2025-03-04 11:28:27,842 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-04 11:28:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2025-03-04 11:28:27,843 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 25 [2025-03-04 11:28:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:27,843 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2025-03-04 11:28:27,843 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-04 11:28:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2025-03-04 11:28:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:28:27,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:27,844 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-04 11:28:27,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:28,044 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-04 11:28:28,045 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-04 11:28:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1244952621, now seen corresponding path program 1 times [2025-03-04 11:28:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-03-04 11:28:28,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:28,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:28:28,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:28:28,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:28,127 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-04 11:28:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516478184] [2025-03-04 11:28:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516478184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854379226] [2025-03-04 11:28:28,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:28,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:28,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:28,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:28,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:28:28,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:28:28,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:28:28,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:28,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:28,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:28:28,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:28,295 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-04 11:28:28,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:28,430 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-04 11:28:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854379226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:28,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-03-04 11:28:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277696751] [2025-03-04 11:28:28,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:28,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:28:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:28,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:28:28,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:28:28,435 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-04 11:28:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:28,861 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2025-03-04 11:28:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:28:28,861 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-04 11:28:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:28,863 INFO L225 Difference]: With dead ends: 172 [2025-03-04 11:28:28,863 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 11:28:28,863 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-04 11:28:28,864 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-04 11:28:28,864 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-04 11:28:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 11:28:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 152. [2025-03-04 11:28:28,871 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-04 11:28:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 187 transitions. [2025-03-04 11:28:28,872 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 187 transitions. Word has length 26 [2025-03-04 11:28:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:28,872 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 187 transitions. [2025-03-04 11:28:28,872 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-04 11:28:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2025-03-04 11:28:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:28:28,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:28,873 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-04 11:28:28,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:28:29,073 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-04 11:28:29,074 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-04 11:28:29,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash 61174386, now seen corresponding path program 1 times [2025-03-04 11:28:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189049036] [2025-03-04 11:28:29,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:29,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:28:29,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:29,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:29,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:29,165 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-04 11:28:29,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189049036] [2025-03-04 11:28:29,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189049036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:29,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408213174] [2025-03-04 11:28:29,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:29,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:29,168 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:29,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:28:29,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:28:29,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:28:29,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:29,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:29,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:28:29,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:29,351 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-04 11:28:29,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408213174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 15 [2025-03-04 11:28:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519255470] [2025-03-04 11:28:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:28:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:29,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:28:29,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:28:29,352 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-04 11:28:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:29,519 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2025-03-04 11:28:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:29,520 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-04 11:28:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:29,521 INFO L225 Difference]: With dead ends: 179 [2025-03-04 11:28:29,521 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 11:28:29,521 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-04 11:28:29,522 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-04 11:28:29,522 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-04 11:28:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 11:28:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2025-03-04 11:28:29,529 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-04 11:28:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2025-03-04 11:28:29,530 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 27 [2025-03-04 11:28:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2025-03-04 11:28:29,531 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-04 11:28:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2025-03-04 11:28:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:28:29,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:29,531 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-04 11:28:29,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:29,732 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-04 11:28:29,732 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-04 11:28:29,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1207110322, now seen corresponding path program 1 times [2025-03-04 11:28:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213049459] [2025-03-04 11:28:29,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:29,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:28:29,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:28:29,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:29,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:29,764 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-04 11:28:29,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:29,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213049459] [2025-03-04 11:28:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213049459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:29,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817797260] [2025-03-04 11:28:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:29,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:29,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:29,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:29,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:29,766 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-04 11:28:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:29,827 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2025-03-04 11:28:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:29,827 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-04 11:28:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:29,828 INFO L225 Difference]: With dead ends: 197 [2025-03-04 11:28:29,828 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:28:29,828 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-04 11:28:29,829 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-04 11:28:29,829 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-04 11:28:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:28:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 182. [2025-03-04 11:28:29,838 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-04 11:28:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2025-03-04 11:28:29,839 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 28 [2025-03-04 11:28:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:29,840 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2025-03-04 11:28:29,840 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-04 11:28:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2025-03-04 11:28:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:28:29,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:29,840 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-04 11:28:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:28:29,842 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-04 11:28:29,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash -715105063, now seen corresponding path program 1 times [2025-03-04 11:28:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613764625] [2025-03-04 11:28:29,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:28:29,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:28:29,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:29,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:29,911 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-04 11:28:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613764625] [2025-03-04 11:28:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613764625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397678810] [2025-03-04 11:28:29,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:29,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:29,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:28:29,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:28:29,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:28:29,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:29,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:29,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:29,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:29,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397678810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:30,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2025-03-04 11:28:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821967257] [2025-03-04 11:28:30,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:30,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:28:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:30,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:28:30,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:28:30,048 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-04 11:28:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:30,238 INFO L93 Difference]: Finished difference Result 231 states and 299 transitions. [2025-03-04 11:28:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:28:30,239 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-04 11:28:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:30,240 INFO L225 Difference]: With dead ends: 231 [2025-03-04 11:28:30,240 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 11:28:30,240 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-04 11:28:30,241 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-04 11:28:30,241 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-04 11:28:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 11:28:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2025-03-04 11:28:30,249 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-04 11:28:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 201 transitions. [2025-03-04 11:28:30,251 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 201 transitions. Word has length 31 [2025-03-04 11:28:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:30,251 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 201 transitions. [2025-03-04 11:28:30,251 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-04 11:28:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 201 transitions. [2025-03-04 11:28:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:28:30,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:30,252 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-04 11:28:30,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:30,453 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-04 11:28:30,453 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-04 11:28:30,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash -45345625, now seen corresponding path program 1 times [2025-03-04 11:28:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:30,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398113536] [2025-03-04 11:28:30,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:30,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:28:30,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:30,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:30,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,507 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-04 11:28:30,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:30,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398113536] [2025-03-04 11:28:30,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398113536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:30,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632693049] [2025-03-04 11:28:30,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:30,510 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:30,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:28:30,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:28:30,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:30,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:30,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:30,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:30,567 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-04 11:28:30,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:30,598 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-04 11:28:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632693049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:30,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:30,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-04 11:28:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336788126] [2025-03-04 11:28:30,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:30,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:28:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:30,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:28:30,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:28:30,599 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-04 11:28:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:30,644 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2025-03-04 11:28:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:28:30,644 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-04 11:28:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:30,645 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:28:30,645 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 11:28:30,646 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-04 11:28:30,646 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-04 11:28:30,646 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-04 11:28:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 11:28:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2025-03-04 11:28:30,652 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-04 11:28:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2025-03-04 11:28:30,653 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 33 [2025-03-04 11:28:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:30,653 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2025-03-04 11:28:30,654 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-04 11:28:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2025-03-04 11:28:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:28:30,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:30,654 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-04 11:28:30,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:30,858 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-04 11:28:30,858 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-04 11:28:30,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1714744656, now seen corresponding path program 2 times [2025-03-04 11:28:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374555872] [2025-03-04 11:28:30,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:30,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 11:28:30,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:30,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:30,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,969 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-04 11:28:30,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374555872] [2025-03-04 11:28:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374555872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403700891] [2025-03-04 11:28:30,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:30,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:30,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:30,972 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:30,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:28:30,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 11:28:31,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:31,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:31,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:31,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:28:31,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:31,164 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-04 11:28:31,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:31,337 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-04 11:28:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403700891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:31,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2025-03-04 11:28:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080262559] [2025-03-04 11:28:31,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:31,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:28:31,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:31,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:28:31,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:28:31,338 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-04 11:28:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:33,042 INFO L93 Difference]: Finished difference Result 405 states and 509 transitions. [2025-03-04 11:28:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 11:28:33,043 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-04 11:28:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:33,044 INFO L225 Difference]: With dead ends: 405 [2025-03-04 11:28:33,044 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 11:28:33,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1093, Invalid=6217, Unknown=0, NotChecked=0, Total=7310 [2025-03-04 11:28:33,047 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-04 11:28:33,047 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-04 11:28:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 11:28:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 323. [2025-03-04 11:28:33,075 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-04 11:28:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 394 transitions. [2025-03-04 11:28:33,077 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 394 transitions. Word has length 33 [2025-03-04 11:28:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:33,077 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 394 transitions. [2025-03-04 11:28:33,077 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-04 11:28:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 394 transitions. [2025-03-04 11:28:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:28:33,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:33,078 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-04 11:28:33,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:28:33,282 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-04 11:28:33,282 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-04 11:28:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:33,282 INFO L85 PathProgramCache]: Analyzing trace with hash 407109072, now seen corresponding path program 1 times [2025-03-04 11:28:33,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-03-04 11:28:33,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:33,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:28:33,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:33,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:33,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819565918] [2025-03-04 11:28:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819565918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448999253] [2025-03-04 11:28:33,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:33,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:33,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:33,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:28:33,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:28:33,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:28:33,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:33,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:33,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:33,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:33,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448999253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:33,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:33,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 11:28:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482736402] [2025-03-04 11:28:33,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:33,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:28:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:33,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:28:33,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:28:33,475 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-04 11:28:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:33,530 INFO L93 Difference]: Finished difference Result 332 states and 404 transitions. [2025-03-04 11:28:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:28:33,530 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-04 11:28:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:33,532 INFO L225 Difference]: With dead ends: 332 [2025-03-04 11:28:33,532 INFO L226 Difference]: Without dead ends: 328 [2025-03-04 11:28:33,532 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-04 11:28:33,532 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-04 11:28:33,533 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-04 11:28:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-04 11:28:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-04 11:28:33,549 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-04 11:28:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 399 transitions. [2025-03-04 11:28:33,552 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 399 transitions. Word has length 33 [2025-03-04 11:28:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:33,552 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 399 transitions. [2025-03-04 11:28:33,552 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-04 11:28:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 399 transitions. [2025-03-04 11:28:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 11:28:33,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:33,553 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-04 11:28:33,559 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-04 11:28:33,753 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-04 11:28:33,754 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-04 11:28:33,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1916225099, now seen corresponding path program 1 times [2025-03-04 11:28:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-03-04 11:28:33,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:33,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 11:28:33,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 11:28:33,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:33,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:33,814 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-04 11:28:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330734440] [2025-03-04 11:28:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330734440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839612250] [2025-03-04 11:28:33,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:33,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:33,817 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:33,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:28:33,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 11:28:33,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 11:28:33,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:33,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:33,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:28:33,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:33,932 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-04 11:28:33,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839612250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:33,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:33,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-03-04 11:28:33,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256807346] [2025-03-04 11:28:33,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:33,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:28:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:33,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:28:33,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:28:33,933 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-04 11:28:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,056 INFO L93 Difference]: Finished difference Result 366 states and 455 transitions. [2025-03-04 11:28:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:28:34,056 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-04 11:28:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,058 INFO L225 Difference]: With dead ends: 366 [2025-03-04 11:28:34,058 INFO L226 Difference]: Without dead ends: 365 [2025-03-04 11:28:34,058 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-04 11:28:34,059 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 53 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-04 11:28:34,059 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-04 11:28:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-04 11:28:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 327. [2025-03-04 11:28:34,076 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-04 11:28:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 386 transitions. [2025-03-04 11:28:34,077 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 386 transitions. Word has length 41 [2025-03-04 11:28:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,077 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 386 transitions. [2025-03-04 11:28:34,077 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-04 11:28:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 386 transitions. [2025-03-04 11:28:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:28:34,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,078 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-04 11:28:34,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:28:34,278 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-04 11:28:34,279 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-04 11:28:34,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1947977286, now seen corresponding path program 1 times [2025-03-04 11:28:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:34,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470126611] [2025-03-04 11:28:34,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:34,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:28:34,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:28:34,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:34,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,376 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-04 11:28:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470126611] [2025-03-04 11:28:34,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470126611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815497735] [2025-03-04 11:28:34,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:34,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:34,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:34,379 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:34,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:28:34,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:28:34,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:28:34,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:34,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:28:34,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:34,475 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-04 11:28:34,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:34,634 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-04 11:28:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815497735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:34,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 11:28:34,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513241136] [2025-03-04 11:28:34,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:34,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:28:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:34,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:28:34,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:28:34,636 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-04 11:28:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:34,759 INFO L93 Difference]: Finished difference Result 344 states and 406 transitions. [2025-03-04 11:28:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:28:34,759 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-04 11:28:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:34,761 INFO L225 Difference]: With dead ends: 344 [2025-03-04 11:28:34,761 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 11:28:34,761 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-04 11:28:34,762 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:34,762 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.0s Time] [2025-03-04 11:28:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 11:28:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-04 11:28:34,791 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-04 11:28:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 396 transitions. [2025-03-04 11:28:34,793 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 396 transitions. Word has length 45 [2025-03-04 11:28:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:34,793 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 396 transitions. [2025-03-04 11:28:34,793 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-04 11:28:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 396 transitions. [2025-03-04 11:28:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:28:34,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:34,794 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-04 11:28:34,801 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-04 11:28:34,999 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-04 11:28:34,999 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-04 11:28:34,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:35,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1253177025, now seen corresponding path program 1 times [2025-03-04 11:28:35,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:35,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382622376] [2025-03-04 11:28:35,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:35,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:35,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:28:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:28:35,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:35,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,271 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-04 11:28:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382622376] [2025-03-04 11:28:35,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382622376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:35,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969107039] [2025-03-04 11:28:35,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:35,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:35,274 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:35,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:28:35,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:28:35,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:28:35,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:35,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:28:35,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:35,353 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-04 11:28:35,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:28:35,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969107039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:35,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:28:35,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2025-03-04 11:28:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303162012] [2025-03-04 11:28:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:35,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:35,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:35,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:28:35,354 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-04 11:28:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:35,419 INFO L93 Difference]: Finished difference Result 581 states and 703 transitions. [2025-03-04 11:28:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:28:35,420 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-04 11:28:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:35,421 INFO L225 Difference]: With dead ends: 581 [2025-03-04 11:28:35,421 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 11:28:35,422 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-04 11:28:35,422 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-04 11:28:35,422 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-04 11:28:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 11:28:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2025-03-04 11:28:35,434 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-04 11:28:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 284 transitions. [2025-03-04 11:28:35,435 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 284 transitions. Word has length 59 [2025-03-04 11:28:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:35,435 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 284 transitions. [2025-03-04 11:28:35,436 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-04 11:28:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 284 transitions. [2025-03-04 11:28:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 11:28:35,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:35,436 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-04 11:28:35,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:28:35,641 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-04 11:28:35,642 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-04 11:28:35,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash 869821702, now seen corresponding path program 2 times [2025-03-04 11:28:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755925092] [2025-03-04 11:28:35,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:35,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 11:28:35,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 11:28:35,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:35,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,848 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-04 11:28:35,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:35,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755925092] [2025-03-04 11:28:35,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755925092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:35,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406960763] [2025-03-04 11:28:35,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:35,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:35,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:35,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:35,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:28:35,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 11:28:35,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 11:28:35,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:35,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:35,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:28:35,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:36,059 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-04 11:28:36,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:36,691 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-04 11:28:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406960763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:36,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:36,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 31 [2025-03-04 11:28:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74735963] [2025-03-04 11:28:36,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:36,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:28:36,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:36,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:28:36,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:28:36,693 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-04 11:28:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:36,980 INFO L93 Difference]: Finished difference Result 283 states and 324 transitions. [2025-03-04 11:28:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:28:36,981 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-04 11:28:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:36,982 INFO L225 Difference]: With dead ends: 283 [2025-03-04 11:28:36,982 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 11:28:36,983 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-04 11:28:36,983 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-04 11:28:36,983 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-04 11:28:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 11:28:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-04 11:28:36,996 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-04 11:28:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 304 transitions. [2025-03-04 11:28:36,997 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 304 transitions. Word has length 83 [2025-03-04 11:28:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:36,997 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 304 transitions. [2025-03-04 11:28:36,997 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-04 11:28:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 304 transitions. [2025-03-04 11:28:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:28:36,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:36,998 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-04 11:28:37,004 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-04 11:28:37,198 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-04 11:28:37,198 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-04 11:28:37,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:37,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1271196347, now seen corresponding path program 2 times [2025-03-04 11:28:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439512883] [2025-03-04 11:28:37,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:37,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:28:37,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:28:37,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:37,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:37,413 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-04 11:28:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:37,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439512883] [2025-03-04 11:28:37,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439512883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:37,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003042079] [2025-03-04 11:28:37,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:37,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:37,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:37,416 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:37,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:28:37,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-04 11:28:37,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:28:37,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:37,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:37,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:28:37,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:37,677 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-04 11:28:37,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:37,920 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-04 11:28:37,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003042079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:37,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:37,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-03-04 11:28:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964544930] [2025-03-04 11:28:37,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:37,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 11:28:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:37,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 11:28:37,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 11:28:37,923 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-04 11:28:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:39,753 INFO L93 Difference]: Finished difference Result 639 states and 742 transitions. [2025-03-04 11:28:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-04 11:28:39,753 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-04 11:28:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:39,756 INFO L225 Difference]: With dead ends: 639 [2025-03-04 11:28:39,756 INFO L226 Difference]: Without dead ends: 638 [2025-03-04 11:28:39,757 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-04 11:28:39,758 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.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:39,758 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.7s Time] [2025-03-04 11:28:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-04 11:28:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 552. [2025-03-04 11:28:39,790 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-04 11:28:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 625 transitions. [2025-03-04 11:28:39,792 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 625 transitions. Word has length 75 [2025-03-04 11:28:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:39,792 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 625 transitions. [2025-03-04 11:28:39,792 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-04 11:28:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 625 transitions. [2025-03-04 11:28:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 11:28:39,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:39,794 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-04 11:28:39,800 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-04 11:28:39,994 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-04 11:28:39,994 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-04 11:28:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2126232966, now seen corresponding path program 3 times [2025-03-04 11:28:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780485071] [2025-03-04 11:28:39,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:39,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 11 equivalence classes. [2025-03-04 11:28:40,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 11:28:40,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:40,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,506 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-04 11:28:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780485071] [2025-03-04 11:28:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780485071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8826070] [2025-03-04 11:28:40,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:40,509 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:40,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:28:40,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 11 equivalence classes. [2025-03-04 11:28:40,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 11:28:40,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:28:40,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 11:28:40,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:40,882 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-04 11:28:40,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:44,087 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-04 11:28:44,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8826070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:44,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 23] total 55 [2025-03-04 11:28:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308736431] [2025-03-04 11:28:44,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:44,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-04 11:28:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:44,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-04 11:28:44,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2675, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 11:28:44,089 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-04 11:28:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:45,006 INFO L93 Difference]: Finished difference Result 641 states and 735 transitions. [2025-03-04 11:28:45,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 11:28:45,006 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-04 11:28:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:45,009 INFO L225 Difference]: With dead ends: 641 [2025-03-04 11:28:45,009 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 11:28:45,011 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-04 11:28:45,011 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-04 11:28:45,011 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-04 11:28:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 11:28:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-04 11:28:45,047 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-04 11:28:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 680 transitions. [2025-03-04 11:28:45,060 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 680 transitions. Word has length 131 [2025-03-04 11:28:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:45,060 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 680 transitions. [2025-03-04 11:28:45,060 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-04 11:28:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 680 transitions. [2025-03-04 11:28:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-04 11:28:45,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:45,065 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-04 11:28:45,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:28:45,266 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-04 11:28:45,266 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-04 11:28:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 572710416, now seen corresponding path program 4 times [2025-03-04 11:28:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950272988] [2025-03-04 11:28:45,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:45,277 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 263 statements into 2 equivalence classes. [2025-03-04 11:28:45,298 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 11:28:45,299 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:45,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:47,570 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-04 11:28:47,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950272988] [2025-03-04 11:28:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950272988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928268734] [2025-03-04 11:28:47,571 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:47,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:47,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:28:47,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:28:47,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 263 statements into 2 equivalence classes. [2025-03-04 11:28:47,692 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 11:28:47,692 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:47,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:47,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-04 11:28:47,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:48,500 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-04 11:28:48,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:43,750 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-04 11:29:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928268734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:43,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 44] total 105 [2025-03-04 11:29:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943028252] [2025-03-04 11:29:43,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:43,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2025-03-04 11:29:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:43,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2025-03-04 11:29:43,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1246, Invalid=9884, Unknown=0, NotChecked=0, Total=11130 [2025-03-04 11:29:43,753 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-04 11:29:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:46,609 INFO L93 Difference]: Finished difference Result 760 states and 870 transitions. [2025-03-04 11:29:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-04 11:29:46,610 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-04 11:29:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:46,612 INFO L225 Difference]: With dead ends: 760 [2025-03-04 11:29:46,612 INFO L226 Difference]: Without dead ends: 702 [2025-03-04 11:29:46,617 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-04 11:29:46,617 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-04 11:29:46,617 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-04 11:29:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-04 11:29:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-03-04 11:29:46,663 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-04 11:29:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 775 transitions. [2025-03-04 11:29:46,665 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 775 transitions. Word has length 263 [2025-03-04 11:29:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:46,665 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 775 transitions. [2025-03-04 11:29:46,665 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-04 11:29:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 775 transitions. [2025-03-04 11:29:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-04 11:29:46,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:46,671 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-04 11:29:46,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:29:46,873 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-04 11:29:46,873 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-04 11:29:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1022755142, now seen corresponding path program 5 times [2025-03-04 11:29:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244908536] [2025-03-04 11:29:46,873 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:46,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 491 statements into 41 equivalence classes. [2025-03-04 11:29:47,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) and asserted 491 of 491 statements. [2025-03-04 11:29:47,100 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2025-03-04 11:29:47,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9135 backedges. 0 proven. 6395 refuted. 0 times theorem prover too weak. 2740 trivial. 0 not checked. [2025-03-04 11:29:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244908536] [2025-03-04 11:29:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244908536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968613639] [2025-03-04 11:29:52,958 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:52,960 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:29:52,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:29:53,450 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 491 statements into 41 equivalence classes. [2025-03-04 11:29:53,571 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) and asserted 491 of 491 statements. [2025-03-04 11:29:53,571 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2025-03-04 11:29:53,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:53,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 158 conjuncts are in the unsatisfiable core [2025-03-04 11:29:53,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9135 backedges. 0 proven. 4415 refuted. 0 times theorem prover too weak. 4720 trivial. 0 not checked. [2025-03-04 11:29:56,157 INFO L312 TraceCheckSpWp]: Computing backward predicates...