./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/MultCommutative-2.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/MultCommutative-2.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 ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:28:21,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:28:21,414 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:21,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:28:21,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:28:21,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:28:21,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:28:21,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:28:21,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:28:21,440 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:28:21,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:28:21,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:28:21,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:28:21,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:28:21,441 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:28:21,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:28:21,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:28:21,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:21,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:28:21,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:28:21,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:28:21,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:28:21,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:28:21,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:28:21,444 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 -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2025-03-04 11:28:21,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:28:21,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:28:21,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:28:21,679 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:28:21,679 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:28:21,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/MultCommutative-2.c [2025-03-04 11:28:22,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ea4cf07/f567e5d3b57a4cb0aa039e95f7c21194/FLAG1f71370db [2025-03-04 11:28:23,041 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:28:23,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c [2025-03-04 11:28:23,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ea4cf07/f567e5d3b57a4cb0aa039e95f7c21194/FLAG1f71370db [2025-03-04 11:28:23,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ea4cf07/f567e5d3b57a4cb0aa039e95f7c21194 [2025-03-04 11:28:23,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:28:23,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:28:23,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:23,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:28:23,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:28:23,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:23" (1/1) ... [2025-03-04 11:28:23,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbae17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:23, skipping insertion in model container [2025-03-04 11:28:23,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:28:23" (1/1) ... [2025-03-04 11:28:23,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:28:23,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:23,186 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:28:23,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:28:23,208 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:28:23,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:23 WrapperNode [2025-03-04 11:28:23,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:28:23,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:23,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:28:23,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:28:23,215 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:23" (1/1) ... [2025-03-04 11:28:23,221 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:23" (1/1) ... [2025-03-04 11:28:23,233 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-03-04 11:28:23,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:28:23,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:28:23,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:28:23,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:28:23,239 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:23" (1/1) ... [2025-03-04 11:28:23,240 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:23" (1/1) ... [2025-03-04 11:28:23,241 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:23" (1/1) ... [2025-03-04 11:28:23,250 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:23,250 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:23" (1/1) ... [2025-03-04 11:28:23,250 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:23" (1/1) ... [2025-03-04 11:28:23,252 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:23" (1/1) ... [2025-03-04 11:28:23,253 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:23" (1/1) ... [2025-03-04 11:28:23,254 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:23" (1/1) ... [2025-03-04 11:28:23,254 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:23" (1/1) ... [2025-03-04 11:28:23,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:28:23,258 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:28:23,258 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:28:23,258 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:28:23,258 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:23" (1/1) ... [2025-03-04 11:28:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:28:23,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:23,282 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:23,283 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:23,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:28:23,300 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-04 11:28:23,300 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-04 11:28:23,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:28:23,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:28:23,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:28:23,342 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:28:23,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:28:23,412 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret5; [2025-03-04 11:28:23,412 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-04 11:28:23,468 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-04 11:28:23,468 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:28:23,478 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:28:23,481 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:28:23,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:23 BoogieIcfgContainer [2025-03-04 11:28:23,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:28:23,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:28:23,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:28:23,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:28:23,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:28:23" (1/3) ... [2025-03-04 11:28:23,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a740049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:23, skipping insertion in model container [2025-03-04 11:28:23,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:28:23" (2/3) ... [2025-03-04 11:28:23,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a740049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:28:23, skipping insertion in model container [2025-03-04 11:28:23,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:28:23" (3/3) ... [2025-03-04 11:28:23,490 INFO L128 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2025-03-04 11:28:23,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:28:23,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG MultCommutative-2.c that has 2 procedures, 35 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 11:28:23,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:28:23,553 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;@a3ca99b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:28:23,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:28:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:28:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:28:23,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:23,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:23,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -52022083, now seen corresponding path program 1 times [2025-03-04 11:28:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:23,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97569782] [2025-03-04 11:28:23,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:23,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:28:23,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:28:23,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:23,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:23,700 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:23,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97569782] [2025-03-04 11:28:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97569782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:23,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:28:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981913832] [2025-03-04 11:28:23,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:23,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:28:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:23,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:28:23,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:28:23,722 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:23,751 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-04 11:28:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:28:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:28:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:23,757 INFO L225 Difference]: With dead ends: 40 [2025-03-04 11:28:23,757 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 11:28:23,759 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:23,761 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 69 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:23,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 69 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:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 11:28:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-04 11:28:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:28:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 11:28:23,784 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2025-03-04 11:28:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:23,784 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 11:28:23,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-04 11:28:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:28:23,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:23,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:23,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:28:23,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1612684587, now seen corresponding path program 1 times [2025-03-04 11:28:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180043682] [2025-03-04 11:28:23,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:23,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:28:23,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:28:23,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:23,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:23,865 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:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180043682] [2025-03-04 11:28:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180043682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:23,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:23,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077672427] [2025-03-04 11:28:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:23,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:23,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:23,867 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:23,922 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-04 11:28:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:23,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 11:28:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:23,923 INFO L225 Difference]: With dead ends: 66 [2025-03-04 11:28:23,924 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 11:28:23,924 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:23,924 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:23,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 11:28:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2025-03-04 11:28:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:28:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-04 11:28:23,930 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 9 [2025-03-04 11:28:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:23,930 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-04 11:28:23,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-04 11:28:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:28:23,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:23,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:23,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:28:23,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:23,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1546409140, now seen corresponding path program 1 times [2025-03-04 11:28:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757696052] [2025-03-04 11:28:23,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:23,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:28:23,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:28:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:23,977 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:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:23,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757696052] [2025-03-04 11:28:23,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757696052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:23,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:23,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761994762] [2025-03-04 11:28:23,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:23,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:23,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:23,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:23,979 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:24,053 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-03-04 11:28:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 11:28:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:24,055 INFO L225 Difference]: With dead ends: 62 [2025-03-04 11:28:24,055 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 11:28:24,055 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:24,055 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:24,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 75 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 11:28:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2025-03-04 11:28:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:28:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2025-03-04 11:28:24,065 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 10 [2025-03-04 11:28:24,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:24,065 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2025-03-04 11:28:24,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:28:24,066 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2025-03-04 11:28:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:28:24,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:24,066 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:24,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:28:24,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -362802601, now seen corresponding path program 1 times [2025-03-04 11:28:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:24,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966128533] [2025-03-04 11:28:24,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:24,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:28:24,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:28:24,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:24,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:24,129 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:24,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966128533] [2025-03-04 11:28:24,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966128533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:24,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:24,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:24,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985103879] [2025-03-04 11:28:24,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:24,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:24,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:24,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:24,131 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:24,205 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2025-03-04 11:28:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2025-03-04 11:28:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:24,206 INFO L225 Difference]: With dead ends: 83 [2025-03-04 11:28:24,206 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 11:28:24,206 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:24,208 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:24,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 72 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 11:28:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2025-03-04 11:28:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 54 states have internal predecessors, (68), 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:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-03-04 11:28:24,223 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 15 [2025-03-04 11:28:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:24,224 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-03-04 11:28:24,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2025-03-04 11:28:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:28:24,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:24,224 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:24,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:28:24,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:24,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1284173025, now seen corresponding path program 1 times [2025-03-04 11:28:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:24,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687606849] [2025-03-04 11:28:24,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:24,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:24,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:28:24,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:28:24,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:24,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:24,294 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:24,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687606849] [2025-03-04 11:28:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687606849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:24,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:24,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:24,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841776907] [2025-03-04 11:28:24,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:24,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:24,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:24,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:24,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:24,297 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 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:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:24,358 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2025-03-04 11:28:24,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:24,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 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 16 [2025-03-04 11:28:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:24,362 INFO L225 Difference]: With dead ends: 125 [2025-03-04 11:28:24,362 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 11:28:24,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:24,363 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:24,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 111 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 11:28:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2025-03-04 11:28:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:28:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2025-03-04 11:28:24,373 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 16 [2025-03-04 11:28:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:24,373 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2025-03-04 11:28:24,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 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:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2025-03-04 11:28:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 11:28:24,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:24,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:24,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:28:24,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:24,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1154634326, now seen corresponding path program 1 times [2025-03-04 11:28:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640899261] [2025-03-04 11:28:24,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:24,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 11:28:24,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 11:28:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:28:24,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640899261] [2025-03-04 11:28:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640899261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:24,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:28:24,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930827096] [2025-03-04 11:28:24,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:24,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:24,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:24,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:24,423 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 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:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:24,504 INFO L93 Difference]: Finished difference Result 102 states and 132 transitions. [2025-03-04 11:28:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:28:24,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 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 17 [2025-03-04 11:28:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:24,506 INFO L225 Difference]: With dead ends: 102 [2025-03-04 11:28:24,506 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 11:28:24,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:24,506 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:24,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 11:28:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-03-04 11:28:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 73 states have internal predecessors, (93), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 11:28:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2025-03-04 11:28:24,518 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 17 [2025-03-04 11:28:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:24,518 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2025-03-04 11:28:24,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 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:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2025-03-04 11:28:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:28:24,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:24,518 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:24,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:28:24,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:24,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2092182040, now seen corresponding path program 1 times [2025-03-04 11:28:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:24,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946177862] [2025-03-04 11:28:24,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:24,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:28:24,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:28:24,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:24,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:24,601 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:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946177862] [2025-03-04 11:28:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946177862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085828650] [2025-03-04 11:28:24,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:24,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:24,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:24,603 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:24,605 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:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:28:24,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:28:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:24,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:24,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:24,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:24,681 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:24,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:24,725 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:24,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085828650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:24,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:24,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-03-04 11:28:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445855449] [2025-03-04 11:28:24,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:24,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:28:24,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:24,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:28:24,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:28:24,726 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:28:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:24,810 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2025-03-04 11:28:24,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:24,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-04 11:28:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:24,811 INFO L225 Difference]: With dead ends: 157 [2025-03-04 11:28:24,811 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:28:24,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:28:24,812 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:24,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 121 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:28:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2025-03-04 11:28:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 97 states have internal predecessors, (124), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 11:28:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2025-03-04 11:28:24,823 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 18 [2025-03-04 11:28:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:24,823 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2025-03-04 11:28:24,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:28:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2025-03-04 11:28:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:28:24,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:24,824 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:24,830 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:25,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:25,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:25,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -566455914, now seen corresponding path program 1 times [2025-03-04 11:28:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103587177] [2025-03-04 11:28:25,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:25,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:28:25,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:28:25,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:28:25,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:25,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103587177] [2025-03-04 11:28:25,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103587177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:28:25,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:28:25,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:28:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383329179] [2025-03-04 11:28:25,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:28:25,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:28:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:25,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:28:25,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:28:25,096 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:25,134 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2025-03-04 11:28:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:28:25,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2025-03-04 11:28:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:25,139 INFO L225 Difference]: With dead ends: 163 [2025-03-04 11:28:25,139 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 11:28:25,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:28:25,140 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:25,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 11:28:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-03-04 11:28:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:28:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-04 11:28:25,145 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-03-04 11:28:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:25,145 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-04 11:28:25,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-04 11:28:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:28:25,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:25,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:25,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:28:25,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:25,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:25,149 INFO L85 PathProgramCache]: Analyzing trace with hash -433133829, now seen corresponding path program 1 times [2025-03-04 11:28:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594523817] [2025-03-04 11:28:25,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:25,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:28:25,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:28:25,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:25,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,223 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:25,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594523817] [2025-03-04 11:28:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594523817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716744979] [2025-03-04 11:28:25,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:25,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:25,225 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:25,227 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:25,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:28:25,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:28:25,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:25,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:25,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:25,288 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:25,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:25,353 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:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716744979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:25,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:25,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 11:28:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206918027] [2025-03-04 11:28:25,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:28:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:25,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:28:25,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:28:25,354 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:25,455 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2025-03-04 11:28:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:28:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-04 11:28:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:25,456 INFO L225 Difference]: With dead ends: 65 [2025-03-04 11:28:25,456 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 11:28:25,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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:25,457 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:25,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 146 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 11:28:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2025-03-04 11:28:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:28:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-03-04 11:28:25,466 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 19 [2025-03-04 11:28:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:25,466 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-03-04 11:28:25,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-03-04 11:28:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:28:25,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:25,467 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:25,475 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:25,671 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,SelfDestructingSolverStorable8 [2025-03-04 11:28:25,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1362614494, now seen corresponding path program 1 times [2025-03-04 11:28:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963330673] [2025-03-04 11:28:25,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:25,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:28:25,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:28:25,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:25,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:28:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:25,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963330673] [2025-03-04 11:28:25,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963330673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:25,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203031094] [2025-03-04 11:28:25,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:25,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:25,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:25,745 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:25,746 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:25,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:28:25,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:28:25,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:25,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:25,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:28:25,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:28:25,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:28:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203031094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:25,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:25,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-03-04 11:28:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565065221] [2025-03-04 11:28:25,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:25,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:28:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:28:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:28:25,834 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:25,898 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-03-04 11:28:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:28:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-04 11:28:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:25,899 INFO L225 Difference]: With dead ends: 70 [2025-03-04 11:28:25,899 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 11:28:25,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:28:25,899 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:25,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 144 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:28:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 11:28:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2025-03-04 11:28:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.127659574468085) internal successors, (53), 46 states have internal predecessors, (53), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:28:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-04 11:28:25,908 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 25 [2025-03-04 11:28:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:25,909 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-04 11:28:25,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-03-04 11:28:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:28:25,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:25,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:25,917 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:26,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:26,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:26,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash -708623675, now seen corresponding path program 1 times [2025-03-04 11:28:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217958060] [2025-03-04 11:28:26,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:28:26,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:28:26,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217958060] [2025-03-04 11:28:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217958060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943476765] [2025-03-04 11:28:26,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:26,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:26,192 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:26,193 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:26,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:28:26,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:28:26,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:28:26,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:26,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943476765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:26,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:26,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-03-04 11:28:26,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819224985] [2025-03-04 11:28:26,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:26,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:28:26,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:26,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:28:26,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:28:26,328 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:26,466 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2025-03-04 11:28:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:28:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-04 11:28:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:26,467 INFO L225 Difference]: With dead ends: 93 [2025-03-04 11:28:26,467 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 11:28:26,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:28:26,468 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:26,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 101 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:26,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 11:28:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-04 11:28:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 46 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:28:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-04 11:28:26,475 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 26 [2025-03-04 11:28:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:26,476 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-04 11:28:26,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:28:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-04 11:28:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:28:26,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:26,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:26,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:28:26,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:26,682 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:26,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1216046511, now seen corresponding path program 1 times [2025-03-04 11:28:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:26,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450061374] [2025-03-04 11:28:26,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:26,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:28:26,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:28:26,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450061374] [2025-03-04 11:28:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450061374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439138780] [2025-03-04 11:28:26,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:26,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:26,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:26,797 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:26,799 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:26,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:28:26,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:28:26,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:26,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:26,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:28:26,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:26,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:28:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439138780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:27,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:27,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 11:28:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021606357] [2025-03-04 11:28:27,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:27,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:28:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:27,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:28:27,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:28:27,084 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:28:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:27,273 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2025-03-04 11:28:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:28:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2025-03-04 11:28:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:27,275 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:28:27,276 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 11:28:27,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:28:27,277 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:27,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 11:28:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2025-03-04 11:28:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 54 states have internal predecessors, (60), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-04 11:28:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-03-04 11:28:27,283 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 30 [2025-03-04 11:28:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:27,284 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-03-04 11:28:27,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:28:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-03-04 11:28:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:28:27,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:27,287 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:27,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:28:27,487 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,SelfDestructingSolverStorable11 [2025-03-04 11:28:27,488 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:27,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash -61999253, now seen corresponding path program 1 times [2025-03-04 11:28:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265116167] [2025-03-04 11:28:27,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:27,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:28:27,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:28:27,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:27,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:28:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:27,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265116167] [2025-03-04 11:28:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265116167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:27,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558689665] [2025-03-04 11:28:27,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:28:27,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:27,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:27,591 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:27,593 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:27,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:28:27,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:28:27,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:28:27,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:27,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:28:27,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:28:27,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:28:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558689665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:27,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:27,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2025-03-04 11:28:27,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405536991] [2025-03-04 11:28:27,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:27,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:28:27,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:27,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:28:27,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:28:27,793 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:28:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:28,068 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2025-03-04 11:28:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:28:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2025-03-04 11:28:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:28,069 INFO L225 Difference]: With dead ends: 118 [2025-03-04 11:28:28,069 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 11:28:28,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:28:28,070 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:28,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 147 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:28:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 11:28:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2025-03-04 11:28:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 58 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 11:28:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-03-04 11:28:28,084 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 37 [2025-03-04 11:28:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:28,084 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-03-04 11:28:28,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 16 states have internal predecessors, (58), 8 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-04 11:28:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2025-03-04 11:28:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:28:28,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:28,085 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:28,091 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:28,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:28,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:28,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:28,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1430237133, now seen corresponding path program 2 times [2025-03-04 11:28:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:28,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200458794] [2025-03-04 11:28:28,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:28,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-04 11:28:28,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:28:28,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:28,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:28:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:28,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200458794] [2025-03-04 11:28:28,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200458794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:28,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119533307] [2025-03-04 11:28:28,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:28,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:28,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:28,527 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:28,529 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:28,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-04 11:28:28,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:28:28,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:28,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:28,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:28:28,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:28:28,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 57 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:28:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119533307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:29,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:29,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2025-03-04 11:28:29,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016979439] [2025-03-04 11:28:29,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:29,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 11:28:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:29,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 11:28:29,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:28:29,358 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 11:28:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:29,749 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2025-03-04 11:28:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 11:28:29,749 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) Word has length 52 [2025-03-04 11:28:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:29,751 INFO L225 Difference]: With dead ends: 144 [2025-03-04 11:28:29,751 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 11:28:29,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=348, Invalid=1908, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 11:28:29,753 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 116 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:29,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 161 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 11:28:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2025-03-04 11:28:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 74 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (20), 14 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-04 11:28:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2025-03-04 11:28:29,762 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 52 [2025-03-04 11:28:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:29,762 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2025-03-04 11:28:29,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 29 states have internal predecessors, (79), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 11:28:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2025-03-04 11:28:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:28:29,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:29,764 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:29,770 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:29,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:29,965 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:29,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1611916257, now seen corresponding path program 2 times [2025-03-04 11:28:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:29,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485563037] [2025-03-04 11:28:29,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:29,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:29,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 11:28:29,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:28:29,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:29,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:28:30,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485563037] [2025-03-04 11:28:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485563037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703457920] [2025-03-04 11:28:30,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:28:30,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:30,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:30,111 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:30,114 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:30,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 11:28:30,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:28:30,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:28:30,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:30,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:28:30,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:28:30,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:28:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703457920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:30,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 25 [2025-03-04 11:28:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763323364] [2025-03-04 11:28:30,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:30,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 11:28:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:30,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 11:28:30,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:28:30,516 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 26 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 11:28:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:30,965 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2025-03-04 11:28:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 11:28:30,965 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 48 [2025-03-04 11:28:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:30,966 INFO L225 Difference]: With dead ends: 155 [2025-03-04 11:28:30,966 INFO L226 Difference]: Without dead ends: 145 [2025-03-04 11:28:30,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=1779, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 11:28:30,967 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 110 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:30,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 138 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:28:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-04 11:28:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2025-03-04 11:28:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 110 states have (on average 1.0636363636363637) internal successors, (117), 109 states have internal predecessors, (117), 9 states have call successors, (9), 6 states have call predecessors, (9), 17 states have return successors, (27), 21 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 11:28:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-03-04 11:28:30,976 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 48 [2025-03-04 11:28:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-03-04 11:28:30,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 9 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-04 11:28:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-03-04 11:28:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 11:28:30,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:30,977 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:30,985 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:31,177 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,SelfDestructingSolverStorable14 [2025-03-04 11:28:31,177 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:31,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash 653628761, now seen corresponding path program 3 times [2025-03-04 11:28:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:31,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873899368] [2025-03-04 11:28:31,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:31,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 10 equivalence classes. [2025-03-04 11:28:31,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 77 of 82 statements. [2025-03-04 11:28:31,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 11:28:31,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 6 proven. 175 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 11:28:31,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873899368] [2025-03-04 11:28:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873899368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229272136] [2025-03-04 11:28:31,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:31,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:31,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:31,564 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:31,565 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:31,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 10 equivalence classes. [2025-03-04 11:28:31,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 77 of 82 statements. [2025-03-04 11:28:31,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 11:28:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:31,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:28:31,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 76 proven. 99 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 11:28:31,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 99 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 11:28:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229272136] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:32,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2025-03-04 11:28:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494406170] [2025-03-04 11:28:32,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:32,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 11:28:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:32,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 11:28:32,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 11:28:32,529 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 38 states, 37 states have (on average 3.0) internal successors, (111), 35 states have internal predecessors, (111), 12 states have call successors, (18), 4 states have call predecessors, (18), 11 states have return successors, (17), 17 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:28:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:33,513 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2025-03-04 11:28:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 11:28:33,513 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 35 states have internal predecessors, (111), 12 states have call successors, (18), 4 states have call predecessors, (18), 11 states have return successors, (17), 17 states have call predecessors, (17), 11 states have call successors, (17) Word has length 82 [2025-03-04 11:28:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:33,516 INFO L225 Difference]: With dead ends: 225 [2025-03-04 11:28:33,516 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 11:28:33,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=831, Invalid=5175, Unknown=0, NotChecked=0, Total=6006 [2025-03-04 11:28:33,518 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 265 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:33,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 254 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:28:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 11:28:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2025-03-04 11:28:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 98 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 17 states have return successors, (26), 20 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-04 11:28:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2025-03-04 11:28:33,531 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 82 [2025-03-04 11:28:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:33,531 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2025-03-04 11:28:33,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.0) internal successors, (111), 35 states have internal predecessors, (111), 12 states have call successors, (18), 4 states have call predecessors, (18), 11 states have return successors, (17), 17 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-04 11:28:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2025-03-04 11:28:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 11:28:33,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:33,532 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:33,539 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:33,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:28:33,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2021463355, now seen corresponding path program 3 times [2025-03-04 11:28:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365039904] [2025-03-04 11:28:33,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:33,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-03-04 11:28:33,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:28:33,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 11:28:33,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 45 proven. 214 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 11:28:34,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365039904] [2025-03-04 11:28:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365039904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030157498] [2025-03-04 11:28:34,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:28:34,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:34,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:34,297 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:34,299 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:34,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-03-04 11:28:34,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:28:34,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-04 11:28:34,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:34,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 11:28:34,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-04 11:28:35,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 30 proven. 199 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-04 11:28:38,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030157498] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:38,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:38,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 53 [2025-03-04 11:28:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145746130] [2025-03-04 11:28:38,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:38,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-04 11:28:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:38,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-04 11:28:38,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2538, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 11:28:38,807 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 54 states, 53 states have (on average 2.4150943396226414) internal successors, (128), 52 states have internal predecessors, (128), 8 states have call successors, (8), 3 states have call predecessors, (8), 19 states have return successors, (24), 23 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-04 11:28:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:40,135 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2025-03-04 11:28:40,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-04 11:28:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.4150943396226414) internal successors, (128), 52 states have internal predecessors, (128), 8 states have call successors, (8), 3 states have call predecessors, (8), 19 states have return successors, (24), 23 states have call predecessors, (24), 6 states have call successors, (24) Word has length 96 [2025-03-04 11:28:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:40,136 INFO L225 Difference]: With dead ends: 237 [2025-03-04 11:28:40,136 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 11:28:40,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 159 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1014, Invalid=7358, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 11:28:40,139 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 153 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:40,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 382 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:28:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 11:28:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 163. [2025-03-04 11:28:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 130 states have internal predecessors, (136), 6 states have call successors, (6), 4 states have call predecessors, (6), 25 states have return successors, (42), 28 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-04 11:28:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2025-03-04 11:28:40,151 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 96 [2025-03-04 11:28:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:40,151 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2025-03-04 11:28:40,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.4150943396226414) internal successors, (128), 52 states have internal predecessors, (128), 8 states have call successors, (8), 3 states have call predecessors, (8), 19 states have return successors, (24), 23 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-04 11:28:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2025-03-04 11:28:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 11:28:40,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:40,152 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:40,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:28:40,352 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,SelfDestructingSolverStorable16 [2025-03-04 11:28:40,353 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:40,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash 426872917, now seen corresponding path program 4 times [2025-03-04 11:28:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597416504] [2025-03-04 11:28:40,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:40,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:40,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-03-04 11:28:40,372 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:28:40,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:40,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 114 proven. 199 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-04 11:28:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597416504] [2025-03-04 11:28:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597416504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570696939] [2025-03-04 11:28:40,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:40,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:40,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:40,933 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:40,934 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:40,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-03-04 11:28:41,020 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:28:41,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:41,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:41,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 11:28:41,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 2 proven. 317 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 11:28:41,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:28:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 32 proven. 319 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 11:28:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570696939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:28:44,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:28:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 26] total 59 [2025-03-04 11:28:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257660498] [2025-03-04 11:28:44,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:28:44,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-04 11:28:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:28:44,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-04 11:28:44,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3182, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 11:28:44,611 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 57 states have internal predecessors, (164), 13 states have call successors, (15), 4 states have call predecessors, (15), 19 states have return successors, (30), 30 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-04 11:28:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:28:47,112 INFO L93 Difference]: Finished difference Result 387 states and 439 transitions. [2025-03-04 11:28:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-03-04 11:28:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 57 states have internal predecessors, (164), 13 states have call successors, (15), 4 states have call predecessors, (15), 19 states have return successors, (30), 30 states have call predecessors, (30), 11 states have call successors, (30) Word has length 114 [2025-03-04 11:28:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:28:47,114 INFO L225 Difference]: With dead ends: 387 [2025-03-04 11:28:47,114 INFO L226 Difference]: Without dead ends: 338 [2025-03-04 11:28:47,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7030 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2579, Invalid=20373, Unknown=0, NotChecked=0, Total=22952 [2025-03-04 11:28:47,119 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 350 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:28:47,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 654 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:28:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-04 11:28:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 203. [2025-03-04 11:28:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.030674846625767) internal successors, (168), 162 states have internal predecessors, (168), 6 states have call successors, (6), 4 states have call predecessors, (6), 33 states have return successors, (50), 36 states have call predecessors, (50), 5 states have call successors, (50) [2025-03-04 11:28:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2025-03-04 11:28:47,138 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 114 [2025-03-04 11:28:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:28:47,139 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2025-03-04 11:28:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.7796610169491527) internal successors, (164), 57 states have internal predecessors, (164), 13 states have call successors, (15), 4 states have call predecessors, (15), 19 states have return successors, (30), 30 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-04 11:28:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2025-03-04 11:28:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 11:28:47,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:28:47,141 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 16, 16, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:28:47,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:28:47,343 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,SelfDestructingSolverStorable17 [2025-03-04 11:28:47,343 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:28:47,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:28:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1074298191, now seen corresponding path program 4 times [2025-03-04 11:28:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:28:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321910738] [2025-03-04 11:28:47,344 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:28:47,351 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 196 statements into 2 equivalence classes. [2025-03-04 11:28:47,369 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 11:28:47,370 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:47,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-03-04 11:28:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:28:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321910738] [2025-03-04 11:28:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321910738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:28:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848786734] [2025-03-04 11:28:48,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 11:28:48,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:28:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:28:48,857 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:48,867 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:48,968 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 196 statements into 2 equivalence classes. [2025-03-04 11:28:48,997 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 11:28:48,997 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 11:28:48,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:28:48,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 11:28:49,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:28:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 0 proven. 909 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-03-04 11:28:49,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:29:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1572 backedges. 70 proven. 909 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2025-03-04 11:29:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848786734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:29:20,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:29:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 38] total 90 [2025-03-04 11:29:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839449183] [2025-03-04 11:29:20,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:29:20,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-04 11:29:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:29:20,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-04 11:29:20,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=7256, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 11:29:20,055 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 91 states, 90 states have (on average 2.3777777777777778) internal successors, (214), 89 states have internal predecessors, (214), 8 states have call successors, (10), 3 states have call predecessors, (10), 31 states have return successors, (48), 48 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-04 11:29:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:29:22,575 INFO L93 Difference]: Finished difference Result 437 states and 505 transitions. [2025-03-04 11:29:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-04 11:29:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 2.3777777777777778) internal successors, (214), 89 states have internal predecessors, (214), 8 states have call successors, (10), 3 states have call predecessors, (10), 31 states have return successors, (48), 48 states have call predecessors, (48), 6 states have call successors, (48) Word has length 196 [2025-03-04 11:29:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:29:22,577 INFO L225 Difference]: With dead ends: 437 [2025-03-04 11:29:22,578 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 11:29:22,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7172 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2928, Invalid=20942, Unknown=0, NotChecked=0, Total=23870 [2025-03-04 11:29:22,582 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 344 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:29:22,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 786 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:29:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 11:29:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 283. [2025-03-04 11:29:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 227 states have (on average 1.0220264317180616) internal successors, (232), 226 states have internal predecessors, (232), 6 states have call successors, (6), 4 states have call predecessors, (6), 49 states have return successors, (82), 52 states have call predecessors, (82), 5 states have call successors, (82) [2025-03-04 11:29:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 320 transitions. [2025-03-04 11:29:22,606 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 320 transitions. Word has length 196 [2025-03-04 11:29:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:29:22,606 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 320 transitions. [2025-03-04 11:29:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 2.3777777777777778) internal successors, (214), 89 states have internal predecessors, (214), 8 states have call successors, (10), 3 states have call predecessors, (10), 31 states have return successors, (48), 48 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-04 11:29:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 320 transitions. [2025-03-04 11:29:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-04 11:29:22,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:29:22,608 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 19, 19, 19, 19, 18, 17, 17, 17, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:29:22,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:29:22,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:22,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:29:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:29:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1625956417, now seen corresponding path program 5 times [2025-03-04 11:29:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:29:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396209966] [2025-03-04 11:29:22,809 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:29:22,821 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 214 statements into 21 equivalence classes. [2025-03-04 11:29:22,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 214 of 214 statements. [2025-03-04 11:29:22,859 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-04 11:29:22,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1857 backedges. 8 proven. 1153 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2025-03-04 11:29:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:29:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396209966] [2025-03-04 11:29:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396209966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:29:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131722209] [2025-03-04 11:29:24,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 11:29:24,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:29:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:29:24,244 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:29:24,245 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:29:24,576 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 214 statements into 21 equivalence classes. [2025-03-04 11:29:24,616 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 214 of 214 statements. [2025-03-04 11:29:24,616 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-04 11:29:24,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:29:24,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-04 11:29:24,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:29:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1857 backedges. 6 proven. 1153 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-03-04 11:29:25,224 INFO L312 TraceCheckSpWp]: Computing backward predicates...