./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/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-?-e2fb8be-m [2025-03-09 02:40:59,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:40:59,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:40:59,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:40:59,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:40:59,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:40:59,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:40:59,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:40:59,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:40:59,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:40:59,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:40:59,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:40:59,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:40:59,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:40:59,877 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:40:59,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:40:59,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:40:59,878 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:40:59,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:40:59,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:40:59,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:40:59,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:40:59,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:40:59,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:40:59,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:40:59,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:40:59,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:40:59,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:40:59,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:40:59,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:40:59,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:40:59,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:40:59,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:40:59,880 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-09 02:41:00,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:41:00,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:41:00,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:41:00,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:41:00,107 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:41:00,109 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-09 02:41:01,225 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322ffc620/b619b2e6e45b4a66a7307d3851ee7560/FLAG7f5ac1938 [2025-03-09 02:41:01,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:41:01,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c [2025-03-09 02:41:01,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322ffc620/b619b2e6e45b4a66a7307d3851ee7560/FLAG7f5ac1938 [2025-03-09 02:41:01,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322ffc620/b619b2e6e45b4a66a7307d3851ee7560 [2025-03-09 02:41:01,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:41:01,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:41:01,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:01,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:41:01,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:41:01,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a92d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01, skipping insertion in model container [2025-03-09 02:41:01,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:41:01,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:01,914 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:41:01,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:01,935 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:41:01,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01 WrapperNode [2025-03-09 02:41:01,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:01,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:01,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:41:01,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:41:01,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,956 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-03-09 02:41:01,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:01,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:41:01,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:41:01,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:41:01,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,978 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 02:41:01,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:41:01,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:41:01,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:41:01,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:41:01,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (1/1) ... [2025-03-09 02:41:01,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:02,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:02,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:41:02,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:41:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:41:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-09 02:41:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-09 02:41:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:41:02,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:41:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:41:02,076 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:41:02,078 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:41:02,132 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret5; [2025-03-09 02:41:02,132 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-09 02:41:02,167 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-09 02:41:02,169 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:41:02,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:41:02,175 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:41:02,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:02 BoogieIcfgContainer [2025-03-09 02:41:02,175 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:41:02,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:41:02,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:41:02,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:41:02,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:41:01" (1/3) ... [2025-03-09 02:41:02,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aab55eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:02, skipping insertion in model container [2025-03-09 02:41:02,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:01" (2/3) ... [2025-03-09 02:41:02,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aab55eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:02, skipping insertion in model container [2025-03-09 02:41:02,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:02" (3/3) ... [2025-03-09 02:41:02,183 INFO L128 eAbstractionObserver]: Analyzing ICFG MultCommutative-2.c [2025-03-09 02:41:02,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:41:02,195 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-09 02:41:02,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:41:02,239 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;@34295620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:41:02,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:41:02,242 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-09 02:41:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:41:02,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting multErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:02,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,250 INFO L85 PathProgramCache]: Analyzing trace with hash -52022083, now seen corresponding path program 1 times [2025-03-09 02:41:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610000648] [2025-03-09 02:41:02,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:41:02,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:41:02,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610000648] [2025-03-09 02:41:02,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610000648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283357258] [2025-03-09 02:41:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:02,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:02,374 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-09 02:41:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,411 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-09 02:41:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:02,413 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-09 02:41:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,416 INFO L225 Difference]: With dead ends: 40 [2025-03-09 02:41:02,416 INFO L226 Difference]: Without dead ends: 29 [2025-03-09 02:41:02,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:02,420 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-09 02:41:02,420 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-09 02:41:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-09 02:41:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-09 02:41:02,442 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-09 02:41:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-09 02:41:02,448 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2025-03-09 02:41:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,450 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-09 02:41:02,450 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-09 02:41:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-09 02:41:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:41:02,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:41:02,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:02,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1612684587, now seen corresponding path program 1 times [2025-03-09 02:41:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555583313] [2025-03-09 02:41:02,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:41:02,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:41:02,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:02,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555583313] [2025-03-09 02:41:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555583313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954639274] [2025-03-09 02:41:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:02,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:02,513 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-09 02:41:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,576 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-03-09 02:41:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:02,577 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-09 02:41:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,579 INFO L225 Difference]: With dead ends: 66 [2025-03-09 02:41:02,579 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 02:41:02,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:41:02,580 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-09 02:41:02,581 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-09 02:41:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 02:41:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2025-03-09 02:41:02,588 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-09 02:41:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-09 02:41:02,589 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 9 [2025-03-09 02:41:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,589 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-09 02:41:02,589 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-09 02:41:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-09 02:41:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:41:02,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:41:02,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1546409140, now seen corresponding path program 1 times [2025-03-09 02:41:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731670831] [2025-03-09 02:41:02,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:41:02,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:41:02,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731670831] [2025-03-09 02:41:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731670831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525500289] [2025-03-09 02:41:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:02,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:02,650 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-09 02:41:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,721 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-03-09 02:41:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:02,723 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-09 02:41:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,723 INFO L225 Difference]: With dead ends: 62 [2025-03-09 02:41:02,723 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 02:41:02,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:41:02,724 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-09 02:41:02,724 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-09 02:41:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 02:41:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2025-03-09 02:41:02,732 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-09 02:41:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2025-03-09 02:41:02,733 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 10 [2025-03-09 02:41:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,734 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2025-03-09 02:41:02,734 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-09 02:41:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2025-03-09 02:41:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:41:02,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,734 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:41:02,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:02,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash -362802601, now seen corresponding path program 1 times [2025-03-09 02:41:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740410170] [2025-03-09 02:41:02,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:41:02,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:41:02,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740410170] [2025-03-09 02:41:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740410170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030450798] [2025-03-09 02:41:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:02,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:02,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:02,801 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-09 02:41:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,872 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2025-03-09 02:41:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:02,873 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-09 02:41:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,874 INFO L225 Difference]: With dead ends: 83 [2025-03-09 02:41:02,874 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 02:41:02,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:41:02,875 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:02,875 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.0s Time] [2025-03-09 02:41:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 02:41:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2025-03-09 02:41:02,883 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-09 02:41:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-03-09 02:41:02,885 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 15 [2025-03-09 02:41:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,885 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-03-09 02:41:02,885 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-09 02:41:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2025-03-09 02:41:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:41:02,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,885 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:41:02,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1284173025, now seen corresponding path program 1 times [2025-03-09 02:41:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182316381] [2025-03-09 02:41:02,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:41:02,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:41:02,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:02,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182316381] [2025-03-09 02:41:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182316381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019297091] [2025-03-09 02:41:02,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:02,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:02,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:02,929 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-09 02:41:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:02,975 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2025-03-09 02:41:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:02,976 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-09 02:41:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:02,977 INFO L225 Difference]: With dead ends: 125 [2025-03-09 02:41:02,977 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 02:41:02,977 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-09 02:41:02,978 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-09 02:41:02,978 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-09 02:41:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 02:41:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2025-03-09 02:41:02,985 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-09 02:41:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2025-03-09 02:41:02,986 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 16 [2025-03-09 02:41:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:02,986 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2025-03-09 02:41:02,986 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-09 02:41:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2025-03-09 02:41:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 02:41:02,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:02,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:41:02,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1154634326, now seen corresponding path program 1 times [2025-03-09 02:41:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:02,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220190866] [2025-03-09 02:41:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:02,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:41:02,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:41:02,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:02,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,038 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-09 02:41:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220190866] [2025-03-09 02:41:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220190866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601429774] [2025-03-09 02:41:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:03,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:03,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:03,040 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-09 02:41:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,109 INFO L93 Difference]: Finished difference Result 102 states and 132 transitions. [2025-03-09 02:41:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:41:03,110 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-09 02:41:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,111 INFO L225 Difference]: With dead ends: 102 [2025-03-09 02:41:03,111 INFO L226 Difference]: Without dead ends: 101 [2025-03-09 02:41:03,111 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-09 02:41:03,111 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-09 02:41:03,111 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-09 02:41:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-09 02:41:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-03-09 02:41:03,126 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-09 02:41:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2025-03-09 02:41:03,127 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 17 [2025-03-09 02:41:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,127 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2025-03-09 02:41:03,127 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-09 02:41:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2025-03-09 02:41:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:41:03,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:41:03,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2092182040, now seen corresponding path program 1 times [2025-03-09 02:41:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369847144] [2025-03-09 02:41:03,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:41:03,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:41:03,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369847144] [2025-03-09 02:41:03,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369847144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908270475] [2025-03-09 02:41:03,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:03,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:03,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:03,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:41:03,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:41:03,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:41:03,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:41:03,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:03,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:03,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908270475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:03,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-03-09 02:41:03,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696573534] [2025-03-09 02:41:03,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:41:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:41:03,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:41:03,330 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-09 02:41:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,416 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2025-03-09 02:41:03,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:03,416 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-09 02:41:03,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,417 INFO L225 Difference]: With dead ends: 157 [2025-03-09 02:41:03,417 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 02:41:03,418 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-09 02:41:03,418 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-09 02:41:03,418 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-09 02:41:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 02:41:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2025-03-09 02:41:03,437 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-09 02:41:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2025-03-09 02:41:03,438 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 18 [2025-03-09 02:41:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,439 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2025-03-09 02:41:03,439 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-09 02:41:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2025-03-09 02:41:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:41:03,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,441 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:41:03,641 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-09 02:41:03,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting multErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -566455914, now seen corresponding path program 1 times [2025-03-09 02:41:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338800561] [2025-03-09 02:41:03,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:41:03,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:41:03,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,682 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-09 02:41:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338800561] [2025-03-09 02:41:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338800561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:41:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003520376] [2025-03-09 02:41:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:03,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:03,684 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-09 02:41:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,719 INFO L93 Difference]: Finished difference Result 163 states and 206 transitions. [2025-03-09 02:41:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:41:03,719 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-09 02:41:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,720 INFO L225 Difference]: With dead ends: 163 [2025-03-09 02:41:03,720 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 02:41:03,720 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-09 02:41:03,721 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-09 02:41:03,721 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-09 02:41:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 02:41:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-03-09 02:41:03,725 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-09 02:41:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-09 02:41:03,726 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 20 [2025-03-09 02:41:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:03,726 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-09 02:41:03,726 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-09 02:41:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-09 02:41:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 02:41:03,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:03,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:03,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:41:03,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:03,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash -433133829, now seen corresponding path program 1 times [2025-03-09 02:41:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:03,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315618000] [2025-03-09 02:41:03,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:41:03,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:41:03,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315618000] [2025-03-09 02:41:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315618000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292127857] [2025-03-09 02:41:03,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:03,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:03,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:03,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:41:03,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:41:03,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:41:03,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:03,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:03,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:03,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:03,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:41:03,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292127857] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:03,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:03,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 02:41:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464179488] [2025-03-09 02:41:03,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:03,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:41:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:03,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:41:03,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:41:03,906 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-09 02:41:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:03,998 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2025-03-09 02:41:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:41:03,999 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-09 02:41:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:03,999 INFO L225 Difference]: With dead ends: 65 [2025-03-09 02:41:03,999 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 02:41:04,000 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-09 02:41:04,000 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-09 02:41:04,000 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-09 02:41:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 02:41:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2025-03-09 02:41:04,005 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-09 02:41:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-03-09 02:41:04,005 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 19 [2025-03-09 02:41:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:04,005 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-03-09 02:41:04,005 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-09 02:41:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-03-09 02:41:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:41:04,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:04,006 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-09 02:41:04,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:04,206 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-09 02:41:04,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:04,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1362614494, now seen corresponding path program 1 times [2025-03-09 02:41:04,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:04,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900128291] [2025-03-09 02:41:04,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:04,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:41:04,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:41:04,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,254 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-09 02:41:04,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:04,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900128291] [2025-03-09 02:41:04,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900128291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:04,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093954146] [2025-03-09 02:41:04,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:04,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:04,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:04,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:41:04,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:41:04,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:41:04,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:41:04,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:04,320 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-09 02:41:04,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:04,362 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-09 02:41:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093954146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:04,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-03-09 02:41:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890657726] [2025-03-09 02:41:04,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:04,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:41:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:04,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:41:04,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:41:04,365 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-09 02:41:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:04,435 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-03-09 02:41:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:41:04,436 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-09 02:41:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:04,436 INFO L225 Difference]: With dead ends: 70 [2025-03-09 02:41:04,437 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 02:41:04,437 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-09 02:41:04,438 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-09 02:41:04,439 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-09 02:41:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 02:41:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2025-03-09 02:41:04,445 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-09 02:41:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-09 02:41:04,445 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 25 [2025-03-09 02:41:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:04,445 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-09 02:41:04,446 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-09 02:41:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-03-09 02:41:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:41:04,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:04,446 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-09 02:41:04,454 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-09 02:41:04,653 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-09 02:41:04,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:04,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash -708623675, now seen corresponding path program 1 times [2025-03-09 02:41:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:04,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153190739] [2025-03-09 02:41:04,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:04,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:41:04,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:41:04,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,730 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-09 02:41:04,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153190739] [2025-03-09 02:41:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153190739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352581995] [2025-03-09 02:41:04,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:04,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:04,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:04,733 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:04,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:41:04,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:41:04,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:41:04,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:04,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:04,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:41:04,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:04,801 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-09 02:41:04,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:04,875 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-09 02:41:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352581995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:04,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-03-09 02:41:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890374363] [2025-03-09 02:41:04,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:04,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:41:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:04,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:41:04,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:41:04,876 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-09 02:41:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:05,014 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2025-03-09 02:41:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:41:05,015 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-09 02:41:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:05,016 INFO L225 Difference]: With dead ends: 93 [2025-03-09 02:41:05,016 INFO L226 Difference]: Without dead ends: 60 [2025-03-09 02:41:05,016 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-09 02:41:05,016 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-09 02:41:05,016 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-09 02:41:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-09 02:41:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-03-09 02:41:05,025 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-09 02:41:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-03-09 02:41:05,025 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 26 [2025-03-09 02:41:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:05,025 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-03-09 02:41:05,025 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-09 02:41:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-03-09 02:41:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:41:05,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:05,026 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-09 02:41:05,033 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-09 02:41:05,231 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-09 02:41:05,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1216046511, now seen corresponding path program 1 times [2025-03-09 02:41:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:05,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677018131] [2025-03-09 02:41:05,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:05,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:41:05,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:41:05,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:05,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:05,321 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-09 02:41:05,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677018131] [2025-03-09 02:41:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677018131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874538210] [2025-03-09 02:41:05,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:05,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:05,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:05,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:05,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:41:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:41:05,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:41:05,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:05,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:05,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:41:05,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:05,434 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-09 02:41:05,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:05,624 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-09 02:41:05,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874538210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:05,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:05,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-09 02:41:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030978739] [2025-03-09 02:41:05,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:05,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:41:05,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:05,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:41:05,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:41:05,626 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-09 02:41:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:05,816 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2025-03-09 02:41:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:41:05,816 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-09 02:41:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:05,817 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:41:05,817 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 02:41:05,818 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-09 02:41:05,818 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-09 02:41:05,818 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-09 02:41:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 02:41:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2025-03-09 02:41:05,825 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-09 02:41:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-03-09 02:41:05,826 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 30 [2025-03-09 02:41:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:05,827 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-03-09 02:41:05,827 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-09 02:41:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-03-09 02:41:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:41:05,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:05,830 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-09 02:41:05,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:06,030 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-09 02:41:06,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash -61999253, now seen corresponding path program 1 times [2025-03-09 02:41:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238414547] [2025-03-09 02:41:06,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:41:06,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:41:06,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,127 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-09 02:41:06,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238414547] [2025-03-09 02:41:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238414547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519206304] [2025-03-09 02:41:06,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:06,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:06,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:06,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:06,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:41:06,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:41:06,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:41:06,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:06,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:41:06,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:06,211 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-09 02:41:06,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:06,283 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-09 02:41:06,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519206304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:06,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:06,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2025-03-09 02:41:06,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386984971] [2025-03-09 02:41:06,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:41:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:06,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:41:06,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:41:06,285 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-09 02:41:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:06,538 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2025-03-09 02:41:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 02:41:06,538 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-09 02:41:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:06,539 INFO L225 Difference]: With dead ends: 118 [2025-03-09 02:41:06,539 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 02:41:06,539 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-09 02:41:06,540 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-09 02:41:06,540 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-09 02:41:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 02:41:06,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2025-03-09 02:41:06,545 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-09 02:41:06,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-03-09 02:41:06,545 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 37 [2025-03-09 02:41:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-03-09 02:41:06,546 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-09 02:41:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2025-03-09 02:41:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:41:06,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:06,547 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-09 02:41:06,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:06,747 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-09 02:41:06,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1430237133, now seen corresponding path program 2 times [2025-03-09 02:41:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035702627] [2025-03-09 02:41:06,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:06,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-09 02:41:06,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:41:06,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:06,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,952 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-09 02:41:06,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035702627] [2025-03-09 02:41:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035702627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302400222] [2025-03-09 02:41:06,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:06,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:06,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:06,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:06,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:41:06,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-09 02:41:06,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:41:06,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:06,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:06,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 02:41:06,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:07,146 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-09 02:41:07,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:07,762 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-09 02:41:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302400222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:07,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:07,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2025-03-09 02:41:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921235575] [2025-03-09 02:41:07,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:07,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 02:41:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:07,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 02:41:07,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-03-09 02:41:07,765 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-09 02:41:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:08,141 INFO L93 Difference]: Finished difference Result 144 states and 167 transitions. [2025-03-09 02:41:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 02:41:08,142 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-09 02:41:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:08,142 INFO L225 Difference]: With dead ends: 144 [2025-03-09 02:41:08,143 INFO L226 Difference]: Without dead ends: 143 [2025-03-09 02:41:08,144 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-09 02:41:08,144 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-09 02:41:08,144 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-09 02:41:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-09 02:41:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2025-03-09 02:41:08,150 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-09 02:41:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2025-03-09 02:41:08,151 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 52 [2025-03-09 02:41:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:08,151 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2025-03-09 02:41:08,151 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-09 02:41:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2025-03-09 02:41:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:41:08,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:08,152 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-09 02:41:08,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:08,352 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-09 02:41:08,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:08,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1611916257, now seen corresponding path program 2 times [2025-03-09 02:41:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316554987] [2025-03-09 02:41:08,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:08,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 02:41:08,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:41:08,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:08,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,497 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-09 02:41:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316554987] [2025-03-09 02:41:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316554987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575581523] [2025-03-09 02:41:08,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:41:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:08,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:08,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:41:08,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-09 02:41:08,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:41:08,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:41:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:08,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:41:08,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:08,617 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-09 02:41:08,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:08,882 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-09 02:41:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575581523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:08,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:08,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 25 [2025-03-09 02:41:08,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430275906] [2025-03-09 02:41:08,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:08,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 02:41:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:08,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 02:41:08,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:41:08,884 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-09 02:41:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:09,335 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2025-03-09 02:41:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 02:41:09,335 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-09 02:41:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:09,336 INFO L225 Difference]: With dead ends: 155 [2025-03-09 02:41:09,336 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 02:41:09,337 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-09 02:41:09,337 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-09 02:41:09,338 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-09 02:41:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 02:41:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2025-03-09 02:41:09,354 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-09 02:41:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-03-09 02:41:09,355 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 48 [2025-03-09 02:41:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:09,355 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-03-09 02:41:09,355 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-09 02:41:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-03-09 02:41:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-09 02:41:09,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:09,356 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-09 02:41:09,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:09,557 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-09 02:41:09,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash 653628761, now seen corresponding path program 3 times [2025-03-09 02:41:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618634423] [2025-03-09 02:41:09,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:09,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 10 equivalence classes. [2025-03-09 02:41:09,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 77 of 82 statements. [2025-03-09 02:41:09,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 02:41:09,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:09,897 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-09 02:41:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618634423] [2025-03-09 02:41:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618634423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36987631] [2025-03-09 02:41:09,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:09,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:09,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:41:09,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 82 statements into 10 equivalence classes. [2025-03-09 02:41:09,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 77 of 82 statements. [2025-03-09 02:41:09,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 02:41:09,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:09,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 02:41:09,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:10,147 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-09 02:41:10,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:10,789 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-09 02:41:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36987631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:10,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2025-03-09 02:41:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098478431] [2025-03-09 02:41:10,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:10,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-09 02:41:10,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:10,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-09 02:41:10,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 02:41:10,791 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-09 02:41:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:11,730 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2025-03-09 02:41:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-09 02:41:11,731 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-09 02:41:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:11,732 INFO L225 Difference]: With dead ends: 225 [2025-03-09 02:41:11,732 INFO L226 Difference]: Without dead ends: 197 [2025-03-09 02:41:11,733 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-09 02:41:11,733 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:11,733 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.3s Time] [2025-03-09 02:41:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-09 02:41:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2025-03-09 02:41:11,744 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-09 02:41:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2025-03-09 02:41:11,746 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 82 [2025-03-09 02:41:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:11,746 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2025-03-09 02:41:11,746 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-09 02:41:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2025-03-09 02:41:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 02:41:11,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:11,747 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-09 02:41:11,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:11,949 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-09 02:41:11,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2021463355, now seen corresponding path program 3 times [2025-03-09 02:41:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681455732] [2025-03-09 02:41:11,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:11,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-03-09 02:41:11,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:41:11,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 02:41:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,541 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-09 02:41:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681455732] [2025-03-09 02:41:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681455732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890608068] [2025-03-09 02:41:12,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:41:12,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:12,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:12,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:12,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:41:12,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 9 equivalence classes. [2025-03-09 02:41:12,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:41:12,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-09 02:41:12,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:12,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 02:41:12,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:13,489 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-09 02:41:13,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:16,900 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-09 02:41:16,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890608068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:16,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:16,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 53 [2025-03-09 02:41:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711165435] [2025-03-09 02:41:16,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:16,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-09 02:41:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:16,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-09 02:41:16,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2538, Unknown=0, NotChecked=0, Total=2862 [2025-03-09 02:41:16,903 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-09 02:41:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:18,189 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2025-03-09 02:41:18,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-09 02:41:18,190 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-09 02:41:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:18,191 INFO L225 Difference]: With dead ends: 237 [2025-03-09 02:41:18,191 INFO L226 Difference]: Without dead ends: 236 [2025-03-09 02:41:18,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 159 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1014, Invalid=7358, Unknown=0, NotChecked=0, Total=8372 [2025-03-09 02:41:18,193 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-09 02:41:18,193 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-09 02:41:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-09 02:41:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 163. [2025-03-09 02:41:18,212 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-09 02:41:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2025-03-09 02:41:18,213 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 96 [2025-03-09 02:41:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2025-03-09 02:41:18,214 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-09 02:41:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2025-03-09 02:41:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-09 02:41:18,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:18,216 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-09 02:41:18,222 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-09 02:41:18,416 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-09 02:41:18,417 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:18,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash 426872917, now seen corresponding path program 4 times [2025-03-09 02:41:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:18,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672154850] [2025-03-09 02:41:18,417 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:18,423 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-03-09 02:41:18,432 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 02:41:18,432 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:18,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:18,979 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-09 02:41:18,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:18,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672154850] [2025-03-09 02:41:18,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672154850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:18,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268369736] [2025-03-09 02:41:18,981 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:18,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:18,982 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:18,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:41:19,051 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-03-09 02:41:19,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 02:41:19,079 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:19,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:19,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 02:41:19,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:19,442 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-09 02:41:19,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:22,460 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-09 02:41:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268369736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:22,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24, 26] total 59 [2025-03-09 02:41:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298148515] [2025-03-09 02:41:22,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:22,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-09 02:41:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:22,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-09 02:41:22,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3182, Unknown=0, NotChecked=0, Total=3540 [2025-03-09 02:41:22,463 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-09 02:41:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:24,834 INFO L93 Difference]: Finished difference Result 387 states and 439 transitions. [2025-03-09 02:41:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-03-09 02:41:24,834 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-09 02:41:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:24,836 INFO L225 Difference]: With dead ends: 387 [2025-03-09 02:41:24,836 INFO L226 Difference]: Without dead ends: 338 [2025-03-09 02:41:24,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7030 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2579, Invalid=20373, Unknown=0, NotChecked=0, Total=22952 [2025-03-09 02:41:24,841 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-09 02:41:24,841 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-09 02:41:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-09 02:41:24,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 203. [2025-03-09 02:41:24,859 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-09 02:41:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2025-03-09 02:41:24,861 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 114 [2025-03-09 02:41:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:24,861 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2025-03-09 02:41:24,861 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-09 02:41:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2025-03-09 02:41:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-09 02:41:24,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:24,863 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-09 02:41:24,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:25,067 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-09 02:41:25,067 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:25,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1074298191, now seen corresponding path program 4 times [2025-03-09 02:41:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:25,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458248528] [2025-03-09 02:41:25,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:25,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 196 statements into 2 equivalence classes. [2025-03-09 02:41:25,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-09 02:41:25,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:25,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:26,631 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-09 02:41:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458248528] [2025-03-09 02:41:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458248528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:41:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681086596] [2025-03-09 02:41:26,632 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:26,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:41:26,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:26,634 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:41:26,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:41:26,733 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 196 statements into 2 equivalence classes. [2025-03-09 02:41:26,761 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 196 of 196 statements. [2025-03-09 02:41:26,762 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:26,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-09 02:41:26,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:41:27,331 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-09 02:41:27,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:41:56,726 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-09 02:41:56,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681086596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:41:56,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:41:56,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 38] total 90 [2025-03-09 02:41:56,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937090888] [2025-03-09 02:41:56,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:41:56,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-09 02:41:56,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:56,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-09 02:41:56,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=7256, Unknown=0, NotChecked=0, Total=8190 [2025-03-09 02:41:56,730 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-09 02:41:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:59,157 INFO L93 Difference]: Finished difference Result 437 states and 505 transitions. [2025-03-09 02:41:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-09 02:41:59,157 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-09 02:41:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:59,159 INFO L225 Difference]: With dead ends: 437 [2025-03-09 02:41:59,159 INFO L226 Difference]: Without dead ends: 436 [2025-03-09 02:41:59,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7172 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2928, Invalid=20942, Unknown=0, NotChecked=0, Total=23870 [2025-03-09 02:41:59,163 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, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:59,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 786 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 02:41:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-09 02:41:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 283. [2025-03-09 02:41:59,187 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-09 02:41:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 320 transitions. [2025-03-09 02:41:59,188 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 320 transitions. Word has length 196 [2025-03-09 02:41:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:59,189 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 320 transitions. [2025-03-09 02:41:59,189 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-09 02:41:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 320 transitions. [2025-03-09 02:41:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-09 02:41:59,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:59,191 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-09 02:41:59,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:41:59,391 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-09 02:41:59,391 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [multErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, multErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:41:59,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:59,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1625956417, now seen corresponding path program 5 times [2025-03-09 02:41:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838092807] [2025-03-09 02:41:59,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:41:59,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:59,405 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 214 statements into 21 equivalence classes. [2025-03-09 02:41:59,441 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 214 of 214 statements. [2025-03-09 02:41:59,441 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-09 02:41:59,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:00,738 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-09 02:42:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:42:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838092807] [2025-03-09 02:42:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838092807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:42:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483531658] [2025-03-09 02:42:00,738 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 02:42:00,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:42:00,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:42:00,740 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:42:00,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:42:01,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 214 statements into 21 equivalence classes. [2025-03-09 02:42:01,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 214 of 214 statements. [2025-03-09 02:42:01,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-03-09 02:42:01,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:42:01,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-09 02:42:01,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:42:01,734 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-09 02:42:01,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:42:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1857 backedges. 76 proven. 1155 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2025-03-09 02:42:30,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483531658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:42:30,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:42:30,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40, 42] total 99 [2025-03-09 02:42:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938360565] [2025-03-09 02:42:30,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:42:30,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-09 02:42:30,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:42:30,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-09 02:42:30,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=8912, Unknown=0, NotChecked=0, Total=9900 [2025-03-09 02:42:30,985 INFO L87 Difference]: Start difference. First operand 283 states and 320 transitions. Second operand has 100 states, 99 states have (on average 2.4646464646464645) internal successors, (244), 98 states have internal predecessors, (244), 11 states have call successors, (13), 3 states have call predecessors, (13), 35 states have return successors, (53), 53 states have call predecessors, (53), 9 states have call successors, (53)