./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark03_linear.i --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/loop-zilu/benchmark03_linear.i -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 36118893e72f01ac34f08ae30ac9eb83d0074096398f7228653cb15beb7a3f4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:57:57,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:57:57,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:57:57,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:57:57,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:57:57,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:57:57,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:57:57,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:57:57,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:57:57,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:57:57,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:57:57,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:57:57,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:57:57,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:57:57,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:57:57,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:57:57,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:57:57,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:57:57,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:57:57,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:57:57,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:57:57,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:57:57,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:57:57,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:57:57,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:57:57,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:57:57,973 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 -> 36118893e72f01ac34f08ae30ac9eb83d0074096398f7228653cb15beb7a3f4b [2025-03-09 01:57:58,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:57:58,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:57:58,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:57:58,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:57:58,199 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:57:58,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark03_linear.i [2025-03-09 01:57:59,318 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2af271b/a2b3dd4e960b4854b93a43471990878f/FLAGb864298f0 [2025-03-09 01:57:59,535 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:57:59,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark03_linear.i [2025-03-09 01:57:59,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2af271b/a2b3dd4e960b4854b93a43471990878f/FLAGb864298f0 [2025-03-09 01:57:59,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2af271b/a2b3dd4e960b4854b93a43471990878f [2025-03-09 01:57:59,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:57:59,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:57:59,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:57:59,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:57:59,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:57:59,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:59" (1/1) ... [2025-03-09 01:57:59,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757176b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:57:59, skipping insertion in model container [2025-03-09 01:57:59,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:57:59" (1/1) ... [2025-03-09 01:57:59,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:58:00,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:58:00,007 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:58:00,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:58:00,031 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:58:00,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00 WrapperNode [2025-03-09 01:58:00,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:58:00,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:58:00,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:58:00,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:58:00,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,052 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-03-09 01:58:00,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:58:00,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:58:00,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:58:00,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:58:00,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,073 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 01:58:00,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:58:00,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:58:00,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:58:00,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:58:00,083 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (1/1) ... [2025-03-09 01:58:00,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:58:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:00,108 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 01:58:00,111 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 01:58:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:58:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:58:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:58:00,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:58:00,172 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:58:00,173 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:58:00,295 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-09 01:58:00,295 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:58:00,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:58:00,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:58:00,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:58:00 BoogieIcfgContainer [2025-03-09 01:58:00,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:58:00,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:58:00,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:58:00,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:58:00,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:57:59" (1/3) ... [2025-03-09 01:58:00,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e37214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:58:00, skipping insertion in model container [2025-03-09 01:58:00,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:58:00" (2/3) ... [2025-03-09 01:58:00,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e37214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:58:00, skipping insertion in model container [2025-03-09 01:58:00,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:58:00" (3/3) ... [2025-03-09 01:58:00,309 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark03_linear.i [2025-03-09 01:58:00,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:58:00,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark03_linear.i that has 1 procedures, 34 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-09 01:58:00,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:58:00,363 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;@52e96ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:58:00,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:58:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:58:00,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:00,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:58:00,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:00,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2099436280, now seen corresponding path program 1 times [2025-03-09 01:58:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494008647] [2025-03-09 01:58:00,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:00,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:00,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:58:00,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:58:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:00,561 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 01:58:00,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494008647] [2025-03-09 01:58:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494008647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:00,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770928314] [2025-03-09 01:58:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:58:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:00,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:58:00,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:00,583 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:00,628 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-03-09 01:58:00,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:58:00,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:58:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:00,634 INFO L225 Difference]: With dead ends: 52 [2025-03-09 01:58:00,634 INFO L226 Difference]: Without dead ends: 30 [2025-03-09 01:58:00,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:00,639 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:00,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-09 01:58:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-09 01:58:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.55) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2025-03-09 01:58:00,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 6 [2025-03-09 01:58:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:00,666 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2025-03-09 01:58:00,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2025-03-09 01:58:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:58:00,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:00,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:00,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:58:00,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:00,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1076364138, now seen corresponding path program 1 times [2025-03-09 01:58:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:00,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359900534] [2025-03-09 01:58:00,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:00,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:58:00,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:58:00,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:00,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:00,733 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 01:58:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359900534] [2025-03-09 01:58:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359900534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893546998] [2025-03-09 01:58:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:58:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:58:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:00,735 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:00,762 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-09 01:58:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:58:00,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:58:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:00,762 INFO L225 Difference]: With dead ends: 34 [2025-03-09 01:58:00,762 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 01:58:00,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:58:00,763 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:00,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 01:58:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 01:58:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-03-09 01:58:00,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 8 [2025-03-09 01:58:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:00,769 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-03-09 01:58:00,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-03-09 01:58:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:58:00,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:00,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:00,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:58:00,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:00,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash 701181492, now seen corresponding path program 1 times [2025-03-09 01:58:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338770968] [2025-03-09 01:58:00,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:00,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:58:00,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:58:00,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:00,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:00,861 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 01:58:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338770968] [2025-03-09 01:58:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338770968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:00,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:00,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:58:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101865001] [2025-03-09 01:58:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:58:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:58:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:00,863 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:00,905 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-03-09 01:58:00,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:58:00,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 01:58:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:00,905 INFO L225 Difference]: With dead ends: 35 [2025-03-09 01:58:00,905 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 01:58:00,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:00,906 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:00,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 01:58:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-03-09 01:58:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-09 01:58:00,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 10 [2025-03-09 01:58:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:00,912 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-09 01:58:00,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-09 01:58:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:58:00,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:00,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:00,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:58:00,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:00,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:00,914 INFO L85 PathProgramCache]: Analyzing trace with hash 261789761, now seen corresponding path program 1 times [2025-03-09 01:58:00,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:00,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969351760] [2025-03-09 01:58:00,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:00,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:58:00,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:58:00,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:00,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,015 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 01:58:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:01,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969351760] [2025-03-09 01:58:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969351760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:01,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:58:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464966214] [2025-03-09 01:58:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:58:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:01,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:58:01,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:01,016 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:01,048 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-03-09 01:58:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:58:01,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:58:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:01,048 INFO L225 Difference]: With dead ends: 35 [2025-03-09 01:58:01,049 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 01:58:01,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:01,050 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:01,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 01:58:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-09 01:58:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-03-09 01:58:01,057 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 11 [2025-03-09 01:58:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:01,057 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-03-09 01:58:01,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-03-09 01:58:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:58:01,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:01,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:01,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:58:01,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:01,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash -474452014, now seen corresponding path program 1 times [2025-03-09 01:58:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949234091] [2025-03-09 01:58:01,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:01,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:58:01,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:58:01,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:01,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,133 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 01:58:01,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:01,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949234091] [2025-03-09 01:58:01,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949234091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:01,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:01,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:58:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520202084] [2025-03-09 01:58:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:01,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:58:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:01,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:58:01,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:01,136 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:01,180 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-03-09 01:58:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:58:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 01:58:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:01,181 INFO L225 Difference]: With dead ends: 37 [2025-03-09 01:58:01,182 INFO L226 Difference]: Without dead ends: 36 [2025-03-09 01:58:01,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:01,183 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:01,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-09 01:58:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-09 01:58:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-09 01:58:01,186 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 12 [2025-03-09 01:58:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:01,186 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-09 01:58:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-09 01:58:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:58:01,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:01,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:01,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:58:01,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:01,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1823110561, now seen corresponding path program 1 times [2025-03-09 01:58:01,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:01,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880008748] [2025-03-09 01:58:01,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:01,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:01,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:58:01,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:58:01,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:01,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,270 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 01:58:01,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:01,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880008748] [2025-03-09 01:58:01,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880008748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:01,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:01,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:58:01,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897038547] [2025-03-09 01:58:01,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:01,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:58:01,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:01,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:58:01,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:01,273 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:01,318 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-09 01:58:01,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:58:01,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:58:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:01,319 INFO L225 Difference]: With dead ends: 37 [2025-03-09 01:58:01,319 INFO L226 Difference]: Without dead ends: 36 [2025-03-09 01:58:01,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:58:01,321 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:01,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-09 01:58:01,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-09 01:58:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-09 01:58:01,325 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 13 [2025-03-09 01:58:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:01,325 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-09 01:58:01,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-09 01:58:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:58:01,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:01,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:01,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:58:01,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:01,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash 337407101, now seen corresponding path program 1 times [2025-03-09 01:58:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:01,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708471578] [2025-03-09 01:58:01,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:01,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:58:01,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:58:01,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:01,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,389 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 01:58:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708471578] [2025-03-09 01:58:01,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708471578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:01,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:01,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:58:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478675535] [2025-03-09 01:58:01,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:01,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:58:01,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:01,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:58:01,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:58:01,391 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:01,456 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2025-03-09 01:58:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:58:01,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:58:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:01,457 INFO L225 Difference]: With dead ends: 56 [2025-03-09 01:58:01,458 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 01:58:01,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:58:01,459 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:01,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 109 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 01:58:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2025-03-09 01:58:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-09 01:58:01,462 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 15 [2025-03-09 01:58:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:01,462 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-09 01:58:01,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-09 01:58:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:58:01,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:01,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:58:01,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:01,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1869685518, now seen corresponding path program 1 times [2025-03-09 01:58:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834100727] [2025-03-09 01:58:01,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:01,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:58:01,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:58:01,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:01,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,529 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 01:58:01,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834100727] [2025-03-09 01:58:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834100727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:01,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:01,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:58:01,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11864191] [2025-03-09 01:58:01,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:01,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:58:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:01,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:58:01,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:58:01,530 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:01,565 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-03-09 01:58:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:58:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:58:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:01,566 INFO L225 Difference]: With dead ends: 56 [2025-03-09 01:58:01,566 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 01:58:01,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:58:01,567 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:01,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 01:58:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2025-03-09 01:58:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-09 01:58:01,569 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 16 [2025-03-09 01:58:01,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:01,569 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-09 01:58:01,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-09 01:58:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:58:01,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:01,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:01,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:58:01,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:01,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2125729839, now seen corresponding path program 1 times [2025-03-09 01:58:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:01,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82976220] [2025-03-09 01:58:01,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:01,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:01,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:58:01,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:58:01,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:01,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,637 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 01:58:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82976220] [2025-03-09 01:58:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82976220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493479516] [2025-03-09 01:58:01,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:01,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:01,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:01,640 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 01:58:01,642 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 01:58:01,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:58:01,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:58:01,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:01,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:01,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:58:01,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:01,723 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 01:58:01,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:58:01,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493479516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:01,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:58:01,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:58:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690188048] [2025-03-09 01:58:01,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:01,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:58:01,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:01,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:58:01,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:58:01,725 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:01,746 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-03-09 01:58:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:58:01,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 01:58:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:01,747 INFO L225 Difference]: With dead ends: 39 [2025-03-09 01:58:01,747 INFO L226 Difference]: Without dead ends: 38 [2025-03-09 01:58:01,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:58:01,748 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:01,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-09 01:58:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-09 01:58:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-09 01:58:01,751 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 17 [2025-03-09 01:58:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:01,751 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-09 01:58:01,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-09 01:58:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:58:01,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:01,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:01,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:58:01,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:01,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:01,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1473115566, now seen corresponding path program 1 times [2025-03-09 01:58:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:01,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471213103] [2025-03-09 01:58:01,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:01,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:58:01,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:58:01,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:01,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471213103] [2025-03-09 01:58:02,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471213103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:02,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491181412] [2025-03-09 01:58:02,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:02,021 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 01:58:02,023 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 01:58:02,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:58:02,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:58:02,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:58:02,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491181412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:02,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:02,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:58:02,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386305564] [2025-03-09 01:58:02,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:58:02,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:58:02,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:58:02,158 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,208 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2025-03-09 01:58:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:58:02,208 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 01:58:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,209 INFO L225 Difference]: With dead ends: 81 [2025-03-09 01:58:02,209 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 01:58:02,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:58:02,209 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 138 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 01:58:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2025-03-09 01:58:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 67 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2025-03-09 01:58:02,217 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 18 [2025-03-09 01:58:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,218 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2025-03-09 01:58:02,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2025-03-09 01:58:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:58:02,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:58:02,420 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,SelfDestructingSolverStorable9 [2025-03-09 01:58:02,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:02,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1578057715, now seen corresponding path program 1 times [2025-03-09 01:58:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741795425] [2025-03-09 01:58:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:58:02,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:58:02,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741795425] [2025-03-09 01:58:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741795425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084567228] [2025-03-09 01:58:02,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:02,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:02,477 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 01:58:02,479 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 01:58:02,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:58:02,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:58:02,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:58:02,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:58:02,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084567228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:02,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:58:02,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:58:02,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970387404] [2025-03-09 01:58:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:58:02,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:58:02,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:58:02,549 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,570 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2025-03-09 01:58:02,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:58:02,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 01:58:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,571 INFO L225 Difference]: With dead ends: 68 [2025-03-09 01:58:02,571 INFO L226 Difference]: Without dead ends: 67 [2025-03-09 01:58:02,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:58:02,572 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-09 01:58:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-09 01:58:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 66 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-03-09 01:58:02,575 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 19 [2025-03-09 01:58:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:02,575 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-03-09 01:58:02,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2025-03-09 01:58:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 01:58:02,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:02,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:02,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:58:02,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:02,780 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:02,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1675148916, now seen corresponding path program 1 times [2025-03-09 01:58:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862037256] [2025-03-09 01:58:02,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:02,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:58:02,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:58:02,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862037256] [2025-03-09 01:58:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862037256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805504456] [2025-03-09 01:58:02,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:02,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:02,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:02,837 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 01:58:02,838 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 01:58:02,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:58:02,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:58:02,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:02,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:02,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:58:02,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:02,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805504456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:02,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:02,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:58:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308988272] [2025-03-09 01:58:02,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:02,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:58:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:02,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:58:02,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:58:02,953 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:02,996 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-03-09 01:58:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:58:02,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-09 01:58:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:02,997 INFO L225 Difference]: With dead ends: 78 [2025-03-09 01:58:02,997 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 01:58:02,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:58:02,997 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:02,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 124 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 01:58:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2025-03-09 01:58:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 68 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-03-09 01:58:03,005 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 20 [2025-03-09 01:58:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:03,005 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-03-09 01:58:03,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-03-09 01:58:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:58:03,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:03,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:03,012 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 01:58:03,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:03,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:03,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash -390008853, now seen corresponding path program 1 times [2025-03-09 01:58:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212577726] [2025-03-09 01:58:03,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:03,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:58:03,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:58:03,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:03,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212577726] [2025-03-09 01:58:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212577726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493716867] [2025-03-09 01:58:03,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:03,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:03,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:03,315 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 01:58:03,316 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 01:58:03,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:58:03,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:58:03,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:03,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:58:03,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:03,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:58:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493716867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:03,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:58:03,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-09 01:58:03,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633429492] [2025-03-09 01:58:03,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:03,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:58:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:03,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:58:03,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:58:03,463 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:03,508 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2025-03-09 01:58:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:58:03,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-09 01:58:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:03,509 INFO L225 Difference]: With dead ends: 69 [2025-03-09 01:58:03,509 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 01:58:03,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:58:03,509 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:03,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 97 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 01:58:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 01:58:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 67 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-09 01:58:03,513 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 21 [2025-03-09 01:58:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:03,513 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-09 01:58:03,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-09 01:58:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:58:03,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:03,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:03,519 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 01:58:03,716 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,SelfDestructingSolverStorable12 [2025-03-09 01:58:03,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:03,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 794627434, now seen corresponding path program 1 times [2025-03-09 01:58:03,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:03,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527236795] [2025-03-09 01:58:03,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:03,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:03,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:58:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:58:03,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:03,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527236795] [2025-03-09 01:58:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527236795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964258205] [2025-03-09 01:58:03,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:03,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:03,799 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 01:58:03,801 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 01:58:03,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:58:03,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:58:03,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:03,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:03,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:58:03,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:03,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:04,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964258205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:04,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:04,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-09 01:58:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273636900] [2025-03-09 01:58:04,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:04,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:58:04,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:04,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:58:04,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:58:04,034 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:04,136 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2025-03-09 01:58:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:58:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-09 01:58:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:04,137 INFO L225 Difference]: With dead ends: 79 [2025-03-09 01:58:04,137 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 01:58:04,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:58:04,138 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:04,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 235 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 01:58:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-03-09 01:58:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 69 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2025-03-09 01:58:04,143 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 22 [2025-03-09 01:58:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:04,143 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2025-03-09 01:58:04,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.909090909090909) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2025-03-09 01:58:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:58:04,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:04,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:04,150 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 01:58:04,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:04,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:04,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1136353335, now seen corresponding path program 1 times [2025-03-09 01:58:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365933031] [2025-03-09 01:58:04,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:04,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:58:04,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:58:04,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:04,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365933031] [2025-03-09 01:58:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365933031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985283038] [2025-03-09 01:58:04,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:04,425 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 01:58:04,427 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 01:58:04,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:58:04,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:58:04,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:04,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:04,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:58:04,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:04,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:58:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985283038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:58:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-09 01:58:04,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039344738] [2025-03-09 01:58:04,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:58:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:58:04,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:58:04,571 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:04,611 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-03-09 01:58:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:58:04,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-09 01:58:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:04,611 INFO L225 Difference]: With dead ends: 70 [2025-03-09 01:58:04,611 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 01:58:04,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:58:04,612 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:04,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 58 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 01:58:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 01:58:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2025-03-09 01:58:04,614 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 23 [2025-03-09 01:58:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:04,614 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2025-03-09 01:58:04,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2025-03-09 01:58:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:58:04,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:04,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:04,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:58:04,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:04,818 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -867215032, now seen corresponding path program 1 times [2025-03-09 01:58:04,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:04,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260256383] [2025-03-09 01:58:04,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:04,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:04,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:58:04,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:58:04,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:04,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:04,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260256383] [2025-03-09 01:58:04,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260256383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623332022] [2025-03-09 01:58:04,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:04,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:04,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:04,892 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 01:58:04,893 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 01:58:04,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:58:04,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:58:04,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:04,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:04,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:58:04,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:05,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:05,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623332022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:05,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-09 01:58:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26115058] [2025-03-09 01:58:05,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:58:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:05,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:58:05,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:58:05,112 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:05,249 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2025-03-09 01:58:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:58:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-09 01:58:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:05,250 INFO L225 Difference]: With dead ends: 124 [2025-03-09 01:58:05,250 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 01:58:05,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:58:05,251 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:05,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 135 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 01:58:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2025-03-09 01:58:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2025-03-09 01:58:05,255 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 24 [2025-03-09 01:58:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:05,255 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2025-03-09 01:58:05,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2025-03-09 01:58:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 01:58:05,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:05,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:58:05,274 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 01:58:05,456 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,SelfDestructingSolverStorable15 [2025-03-09 01:58:05,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash -974749819, now seen corresponding path program 1 times [2025-03-09 01:58:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343545562] [2025-03-09 01:58:05,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:05,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:58:05,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:58:05,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:05,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:05,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:05,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343545562] [2025-03-09 01:58:05,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343545562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:05,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:05,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588436718] [2025-03-09 01:58:05,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:05,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:58:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:05,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:58:05,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:58:05,508 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:05,519 INFO L93 Difference]: Finished difference Result 175 states and 190 transitions. [2025-03-09 01:58:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:58:05,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-09 01:58:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:05,521 INFO L225 Difference]: With dead ends: 175 [2025-03-09 01:58:05,521 INFO L226 Difference]: Without dead ends: 134 [2025-03-09 01:58:05,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 01:58:05,522 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:05,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-09 01:58:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2025-03-09 01:58:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.128) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-03-09 01:58:05,530 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 27 [2025-03-09 01:58:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-03-09 01:58:05,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-03-09 01:58:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 01:58:05,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:05,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:58:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:58:05,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:05,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:05,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1180394760, now seen corresponding path program 1 times [2025-03-09 01:58:05,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:05,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049504147] [2025-03-09 01:58:05,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:05,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:58:05,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:58:05,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:05,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:05,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049504147] [2025-03-09 01:58:05,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049504147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:05,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833359704] [2025-03-09 01:58:05,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:05,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:05,632 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 01:58:05,640 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 01:58:05,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:58:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:58:05,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:05,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:58:05,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:05,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:05,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833359704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:05,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:05,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-03-09 01:58:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812794776] [2025-03-09 01:58:05,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:05,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:58:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:05,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:58:05,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:58:05,933 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:06,097 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2025-03-09 01:58:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:58:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-09 01:58:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:06,098 INFO L225 Difference]: With dead ends: 156 [2025-03-09 01:58:06,098 INFO L226 Difference]: Without dead ends: 154 [2025-03-09 01:58:06,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:58:06,099 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 91 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:06,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 153 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-09 01:58:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 119. [2025-03-09 01:58:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 118 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2025-03-09 01:58:06,103 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 29 [2025-03-09 01:58:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:06,103 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2025-03-09 01:58:06,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.037037037037037) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2025-03-09 01:58:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:58:06,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:06,107 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:58:06,112 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 01:58:06,311 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,SelfDestructingSolverStorable17 [2025-03-09 01:58:06,311 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:06,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash 378380168, now seen corresponding path program 1 times [2025-03-09 01:58:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:06,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451684690] [2025-03-09 01:58:06,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:06,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:58:06,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:58:06,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:06,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:58:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:06,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451684690] [2025-03-09 01:58:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451684690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:58:06,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:58:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:58:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845625657] [2025-03-09 01:58:06,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:58:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:58:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:06,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:58:06,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:58:06,347 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:06,354 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2025-03-09 01:58:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:58:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-09 01:58:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:06,355 INFO L225 Difference]: With dead ends: 159 [2025-03-09 01:58:06,355 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 01:58:06,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 01:58:06,356 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:06,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 01:58:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2025-03-09 01:58:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0943396226415094) internal successors, (116), 110 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2025-03-09 01:58:06,361 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 50 [2025-03-09 01:58:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:06,361 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2025-03-09 01:58:06,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2025-03-09 01:58:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 01:58:06,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:06,362 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-09 01:58:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:58:06,362 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2116818117, now seen corresponding path program 2 times [2025-03-09 01:58:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183330345] [2025-03-09 01:58:06,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:06,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:58:06,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:58:06,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:06,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183330345] [2025-03-09 01:58:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183330345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675084051] [2025-03-09 01:58:06,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:06,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:06,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:06,537 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 01:58:06,539 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 01:58:06,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:58:06,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:58:06,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:06,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:06,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:58:06,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:06,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:06,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675084051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:06,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2025-03-09 01:58:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27241988] [2025-03-09 01:58:06,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:06,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:58:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:06,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:58:06,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:58:06,875 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 35 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 35 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:07,118 INFO L93 Difference]: Finished difference Result 290 states and 332 transitions. [2025-03-09 01:58:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-09 01:58:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 35 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-09 01:58:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:07,119 INFO L225 Difference]: With dead ends: 290 [2025-03-09 01:58:07,120 INFO L226 Difference]: Without dead ends: 289 [2025-03-09 01:58:07,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2025-03-09 01:58:07,121 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 102 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:07,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 536 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-09 01:58:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2025-03-09 01:58:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.2045454545454546) internal successors, (318), 268 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 318 transitions. [2025-03-09 01:58:07,130 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 318 transitions. Word has length 51 [2025-03-09 01:58:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:07,130 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 318 transitions. [2025-03-09 01:58:07,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.4411764705882355) internal successors, (151), 35 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 318 transitions. [2025-03-09 01:58:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 01:58:07,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:07,131 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2025-03-09 01:58:07,137 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 01:58:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:07,337 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1176055579, now seen corresponding path program 1 times [2025-03-09 01:58:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376409809] [2025-03-09 01:58:07,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:07,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:58:07,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:58:07,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:07,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:07,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:07,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376409809] [2025-03-09 01:58:07,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376409809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:07,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248700417] [2025-03-09 01:58:07,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:58:07,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:07,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:07,549 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 01:58:07,551 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 01:58:07,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:58:07,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:58:07,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:58:07,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:07,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:58:07,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:07,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248700417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:08,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:08,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2025-03-09 01:58:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982954639] [2025-03-09 01:58:08,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:08,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-09 01:58:08,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:08,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-09 01:58:08,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1987, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 01:58:08,189 INFO L87 Difference]: Start difference. First operand 269 states and 318 transitions. Second operand has 50 states, 49 states have (on average 3.142857142857143) internal successors, (154), 50 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:08,596 INFO L93 Difference]: Finished difference Result 275 states and 318 transitions. [2025-03-09 01:58:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-09 01:58:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.142857142857143) internal successors, (154), 50 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-09 01:58:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:08,598 INFO L225 Difference]: With dead ends: 275 [2025-03-09 01:58:08,598 INFO L226 Difference]: Without dead ends: 274 [2025-03-09 01:58:08,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=733, Invalid=3173, Unknown=0, NotChecked=0, Total=3906 [2025-03-09 01:58:08,599 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 104 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:08,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 266 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-09 01:58:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 269. [2025-03-09 01:58:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.1742424242424243) internal successors, (310), 268 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 310 transitions. [2025-03-09 01:58:08,609 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 310 transitions. Word has length 52 [2025-03-09 01:58:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:08,609 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 310 transitions. [2025-03-09 01:58:08,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.142857142857143) internal successors, (154), 50 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 310 transitions. [2025-03-09 01:58:08,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 01:58:08,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:08,610 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-09 01:58:08,615 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 01:58:08,813 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,SelfDestructingSolverStorable20 [2025-03-09 01:58:08,814 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:08,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1552288029, now seen corresponding path program 2 times [2025-03-09 01:58:08,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:08,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135939317] [2025-03-09 01:58:08,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:08,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:08,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-09 01:58:08,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 01:58:08,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:08,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:08,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135939317] [2025-03-09 01:58:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135939317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474711547] [2025-03-09 01:58:08,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:08,981 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 01:58:08,982 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 01:58:09,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-09 01:58:09,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 01:58:09,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:09,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:09,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:58:09,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:09,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474711547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:09,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:09,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2025-03-09 01:58:09,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738292282] [2025-03-09 01:58:09,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:09,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:58:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:09,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:58:09,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:58:09,312 INFO L87 Difference]: Start difference. First operand 269 states and 310 transitions. Second operand has 35 states, 34 states have (on average 4.617647058823529) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:09,566 INFO L93 Difference]: Finished difference Result 287 states and 316 transitions. [2025-03-09 01:58:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:58:09,568 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.617647058823529) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-09 01:58:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:09,569 INFO L225 Difference]: With dead ends: 287 [2025-03-09 01:58:09,569 INFO L226 Difference]: Without dead ends: 286 [2025-03-09 01:58:09,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=349, Invalid=1721, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 01:58:09,570 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 107 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:09,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 547 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-09 01:58:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2025-03-09 01:58:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.126865671641791) internal successors, (302), 272 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 302 transitions. [2025-03-09 01:58:09,577 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 302 transitions. Word has length 53 [2025-03-09 01:58:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 302 transitions. [2025-03-09 01:58:09,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.617647058823529) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 302 transitions. [2025-03-09 01:58:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:58:09,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:09,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2025-03-09 01:58:09,583 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 01:58:09,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:58:09,778 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:09,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1823537464, now seen corresponding path program 2 times [2025-03-09 01:58:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:09,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402698260] [2025-03-09 01:58:09,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:09,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-09 01:58:09,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:58:09,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:09,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402698260] [2025-03-09 01:58:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402698260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426617216] [2025-03-09 01:58:10,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:10,019 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 01:58:10,022 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 01:58:10,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-09 01:58:10,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:58:10,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:10,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:58:10,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:10,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426617216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:10,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 51 [2025-03-09 01:58:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830376083] [2025-03-09 01:58:10,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:10,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-09 01:58:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:10,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-09 01:58:10,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2150, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 01:58:10,625 INFO L87 Difference]: Start difference. First operand 273 states and 302 transitions. Second operand has 52 states, 51 states have (on average 3.1372549019607843) internal successors, (160), 52 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:11,068 INFO L93 Difference]: Finished difference Result 281 states and 302 transitions. [2025-03-09 01:58:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-09 01:58:11,071 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.1372549019607843) internal successors, (160), 52 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-09 01:58:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:11,072 INFO L225 Difference]: With dead ends: 281 [2025-03-09 01:58:11,072 INFO L226 Difference]: Without dead ends: 280 [2025-03-09 01:58:11,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=891, Invalid=3801, Unknown=0, NotChecked=0, Total=4692 [2025-03-09 01:58:11,074 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 243 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:11,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 325 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-09 01:58:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 273. [2025-03-09 01:58:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.1119402985074627) internal successors, (298), 272 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 298 transitions. [2025-03-09 01:58:11,083 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 298 transitions. Word has length 55 [2025-03-09 01:58:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:11,083 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 298 transitions. [2025-03-09 01:58:11,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.1372549019607843) internal successors, (160), 52 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 298 transitions. [2025-03-09 01:58:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:58:11,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:11,084 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-09 01:58:11,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:58:11,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 01:58:11,288 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:11,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1395144447, now seen corresponding path program 2 times [2025-03-09 01:58:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940592750] [2025-03-09 01:58:11,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:11,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-09 01:58:11,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:58:11,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:11,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940592750] [2025-03-09 01:58:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940592750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489876707] [2025-03-09 01:58:11,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:11,519 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:11,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:58:11,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-09 01:58:11,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:58:11,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:11,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:11,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:58:11,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:11,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:12,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489876707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:12,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:12,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2025-03-09 01:58:12,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888646250] [2025-03-09 01:58:12,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:12,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-09 01:58:12,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:12,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-09 01:58:12,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2028, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 01:58:12,092 INFO L87 Difference]: Start difference. First operand 273 states and 298 transitions. Second operand has 50 states, 49 states have (on average 3.326530612244898) internal successors, (163), 50 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:12,415 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2025-03-09 01:58:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 01:58:12,416 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.326530612244898) internal successors, (163), 50 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-09 01:58:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:12,417 INFO L225 Difference]: With dead ends: 278 [2025-03-09 01:58:12,417 INFO L226 Difference]: Without dead ends: 277 [2025-03-09 01:58:12,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2025-03-09 01:58:12,418 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 145 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:12,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 408 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:58:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-09 01:58:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2025-03-09 01:58:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.0671641791044777) internal successors, (286), 272 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 286 transitions. [2025-03-09 01:58:12,425 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 286 transitions. Word has length 55 [2025-03-09 01:58:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:12,425 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 286 transitions. [2025-03-09 01:58:12,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.326530612244898) internal successors, (163), 50 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 286 transitions. [2025-03-09 01:58:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 01:58:12,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:12,426 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1] [2025-03-09 01:58:12,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 01:58:12,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:12,630 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash -749769761, now seen corresponding path program 2 times [2025-03-09 01:58:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208709455] [2025-03-09 01:58:12,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:12,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-03-09 01:58:12,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 01:58:12,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:12,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:13,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208709455] [2025-03-09 01:58:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208709455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:13,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742476396] [2025-03-09 01:58:13,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:13,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:13,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:13,083 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:13,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:58:13,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-03-09 01:58:13,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 01:58:13,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:13,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:13,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 01:58:13,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:13,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742476396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:14,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:14,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2025-03-09 01:58:14,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105649723] [2025-03-09 01:58:14,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:14,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2025-03-09 01:58:14,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:14,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2025-03-09 01:58:14,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1096, Invalid=6214, Unknown=0, NotChecked=0, Total=7310 [2025-03-09 01:58:14,401 INFO L87 Difference]: Start difference. First operand 273 states and 286 transitions. Second operand has 86 states, 85 states have (on average 3.541176470588235) internal successors, (301), 86 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:15,821 INFO L93 Difference]: Finished difference Result 371 states and 397 transitions. [2025-03-09 01:58:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-09 01:58:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.541176470588235) internal successors, (301), 86 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-09 01:58:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:15,823 INFO L225 Difference]: With dead ends: 371 [2025-03-09 01:58:15,823 INFO L226 Difference]: Without dead ends: 370 [2025-03-09 01:58:15,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5393 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2375, Invalid=11905, Unknown=0, NotChecked=0, Total=14280 [2025-03-09 01:58:15,826 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 301 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:15,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 642 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:58:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-09 01:58:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 354. [2025-03-09 01:58:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 349 states have (on average 1.1031518624641834) internal successors, (385), 353 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 385 transitions. [2025-03-09 01:58:15,838 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 385 transitions. Word has length 101 [2025-03-09 01:58:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:15,838 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 385 transitions. [2025-03-09 01:58:15,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.541176470588235) internal successors, (301), 86 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:15,839 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 385 transitions. [2025-03-09 01:58:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 01:58:15,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:15,839 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1] [2025-03-09 01:58:15,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 01:58:16,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:16,040 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:16,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:16,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1576155720, now seen corresponding path program 3 times [2025-03-09 01:58:16,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:16,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185084554] [2025-03-09 01:58:16,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:16,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 8 equivalence classes. [2025-03-09 01:58:16,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 01:58:16,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 01:58:16,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185084554] [2025-03-09 01:58:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185084554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:16,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871814754] [2025-03-09 01:58:16,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:16,673 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:16,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:58:16,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 8 equivalence classes. [2025-03-09 01:58:16,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 01:58:16,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 01:58:16,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:16,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:58:16,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:17,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:18,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871814754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:18,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:18,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 99 [2025-03-09 01:58:18,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777333209] [2025-03-09 01:58:18,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:18,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-09 01:58:18,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:18,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-09 01:58:18,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1614, Invalid=8286, Unknown=0, NotChecked=0, Total=9900 [2025-03-09 01:58:18,184 INFO L87 Difference]: Start difference. First operand 354 states and 385 transitions. Second operand has 100 states, 99 states have (on average 3.191919191919192) internal successors, (316), 100 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:19,880 INFO L93 Difference]: Finished difference Result 439 states and 467 transitions. [2025-03-09 01:58:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-09 01:58:19,880 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 3.191919191919192) internal successors, (316), 100 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-09 01:58:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:19,881 INFO L225 Difference]: With dead ends: 439 [2025-03-09 01:58:19,881 INFO L226 Difference]: Without dead ends: 437 [2025-03-09 01:58:19,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7788 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3263, Invalid=16477, Unknown=0, NotChecked=0, Total=19740 [2025-03-09 01:58:19,883 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 622 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:19,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 575 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-09 01:58:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 413. [2025-03-09 01:58:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 408 states have (on average 1.1102941176470589) internal successors, (453), 412 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 453 transitions. [2025-03-09 01:58:19,893 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 453 transitions. Word has length 107 [2025-03-09 01:58:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:19,893 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 453 transitions. [2025-03-09 01:58:19,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 3.191919191919192) internal successors, (316), 100 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 453 transitions. [2025-03-09 01:58:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-09 01:58:19,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:19,894 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-09 01:58:19,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 01:58:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 01:58:20,095 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:20,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1273162207, now seen corresponding path program 3 times [2025-03-09 01:58:20,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:20,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133193624] [2025-03-09 01:58:20,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:20,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 11 equivalence classes. [2025-03-09 01:58:20,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 01:58:20,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:58:20,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133193624] [2025-03-09 01:58:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133193624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382726685] [2025-03-09 01:58:20,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:20,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:20,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:20,729 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:20,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:58:20,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 11 equivalence classes. [2025-03-09 01:58:20,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 01:58:20,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:58:20,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:20,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 01:58:20,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:21,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:22,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382726685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:22,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:22,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2025-03-09 01:58:22,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580673212] [2025-03-09 01:58:22,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:22,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2025-03-09 01:58:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:22,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2025-03-09 01:58:22,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=9165, Unknown=0, NotChecked=0, Total=10712 [2025-03-09 01:58:22,479 INFO L87 Difference]: Start difference. First operand 413 states and 453 transitions. Second operand has 104 states, 103 states have (on average 3.504854368932039) internal successors, (361), 104 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:24,037 INFO L93 Difference]: Finished difference Result 565 states and 629 transitions. [2025-03-09 01:58:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-09 01:58:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 103 states have (on average 3.504854368932039) internal successors, (361), 104 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-09 01:58:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:24,038 INFO L225 Difference]: With dead ends: 565 [2025-03-09 01:58:24,038 INFO L226 Difference]: Without dead ends: 564 [2025-03-09 01:58:24,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7249 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2765, Invalid=15595, Unknown=0, NotChecked=0, Total=18360 [2025-03-09 01:58:24,040 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 640 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:24,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 823 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:58:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-09 01:58:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 541. [2025-03-09 01:58:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 536 states have (on average 1.1287313432835822) internal successors, (605), 540 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 605 transitions. [2025-03-09 01:58:24,052 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 605 transitions. Word has length 121 [2025-03-09 01:58:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:24,052 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 605 transitions. [2025-03-09 01:58:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 103 states have (on average 3.504854368932039) internal successors, (361), 104 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 605 transitions. [2025-03-09 01:58:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-09 01:58:24,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:24,053 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2025-03-09 01:58:24,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:58:24,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 01:58:24,254 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:24,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash -721675314, now seen corresponding path program 3 times [2025-03-09 01:58:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417343781] [2025-03-09 01:58:24,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:24,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 12 equivalence classes. [2025-03-09 01:58:24,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 51 of 128 statements. [2025-03-09 01:58:24,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:58:24,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 312 proven. 57 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-09 01:58:24,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417343781] [2025-03-09 01:58:24,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417343781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:24,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844236681] [2025-03-09 01:58:24,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:24,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:24,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:24,371 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:24,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 01:58:24,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 12 equivalence classes. [2025-03-09 01:58:24,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 51 of 128 statements. [2025-03-09 01:58:24,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:58:24,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:24,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:58:24,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 312 proven. 57 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-09 01:58:24,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 312 proven. 57 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-09 01:58:24,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844236681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:24,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:24,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-09 01:58:24,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643010318] [2025-03-09 01:58:24,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:24,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:58:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:58:24,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:58:24,642 INFO L87 Difference]: Start difference. First operand 541 states and 605 transitions. Second operand has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:24,741 INFO L93 Difference]: Finished difference Result 541 states and 605 transitions. [2025-03-09 01:58:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:58:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-09 01:58:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:24,743 INFO L225 Difference]: With dead ends: 541 [2025-03-09 01:58:24,743 INFO L226 Difference]: Without dead ends: 540 [2025-03-09 01:58:24,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:58:24,744 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:24,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 95 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-09 01:58:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-09 01:58:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 536 states have (on average 1.083955223880597) internal successors, (581), 539 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 581 transitions. [2025-03-09 01:58:24,757 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 581 transitions. Word has length 128 [2025-03-09 01:58:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:24,758 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 581 transitions. [2025-03-09 01:58:24,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 581 transitions. [2025-03-09 01:58:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 01:58:24,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:24,759 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2025-03-09 01:58:24,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 01:58:24,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 01:58:24,960 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:24,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2040242260, now seen corresponding path program 3 times [2025-03-09 01:58:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929450256] [2025-03-09 01:58:24,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:24,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 01:58:24,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 53 of 130 statements. [2025-03-09 01:58:24,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:58:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 320 proven. 57 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-09 01:58:25,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:25,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929450256] [2025-03-09 01:58:25,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929450256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:25,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257552046] [2025-03-09 01:58:25,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:58:25,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:25,071 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:25,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 01:58:25,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 12 equivalence classes. [2025-03-09 01:58:25,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 53 of 130 statements. [2025-03-09 01:58:25,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 01:58:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:25,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:58:25,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 320 proven. 57 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-09 01:58:25,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 320 proven. 57 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-09 01:58:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257552046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:25,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:25,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-09 01:58:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895865669] [2025-03-09 01:58:25,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:25,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:58:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:25,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:58:25,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:58:25,341 INFO L87 Difference]: Start difference. First operand 540 states and 581 transitions. Second operand has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:25,451 INFO L93 Difference]: Finished difference Result 540 states and 581 transitions. [2025-03-09 01:58:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:58:25,451 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-09 01:58:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:25,452 INFO L225 Difference]: With dead ends: 540 [2025-03-09 01:58:25,452 INFO L226 Difference]: Without dead ends: 539 [2025-03-09 01:58:25,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:58:25,453 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:25,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:58:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-09 01:58:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-09 01:58:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 536 states have (on average 1.039179104477612) internal successors, (557), 538 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 557 transitions. [2025-03-09 01:58:25,471 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 557 transitions. Word has length 130 [2025-03-09 01:58:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:25,472 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 557 transitions. [2025-03-09 01:58:25,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 557 transitions. [2025-03-09 01:58:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-09 01:58:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:25,473 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1] [2025-03-09 01:58:25,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 01:58:25,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 01:58:25,674 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:25,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -268466587, now seen corresponding path program 2 times [2025-03-09 01:58:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:25,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392401950] [2025-03-09 01:58:25,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:25,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 208 statements into 2 equivalence classes. [2025-03-09 01:58:25,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-03-09 01:58:25,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:25,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 0 proven. 1515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392401950] [2025-03-09 01:58:27,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392401950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:27,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159851226] [2025-03-09 01:58:27,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:58:27,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:27,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:27,237 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:27,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-09 01:58:27,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 208 statements into 2 equivalence classes. [2025-03-09 01:58:27,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-03-09 01:58:27,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:58:27,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:27,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-09 01:58:27,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 0 proven. 1515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:29,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 0 proven. 1515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:32,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159851226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:32,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:32,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 193 [2025-03-09 01:58:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569353091] [2025-03-09 01:58:32,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:32,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 194 states [2025-03-09 01:58:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:32,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2025-03-09 01:58:32,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5527, Invalid=31915, Unknown=0, NotChecked=0, Total=37442 [2025-03-09 01:58:32,048 INFO L87 Difference]: Start difference. First operand 539 states and 557 transitions. Second operand has 194 states, 193 states have (on average 3.22279792746114) internal successors, (622), 194 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:37,555 INFO L93 Difference]: Finished difference Result 782 states and 837 transitions. [2025-03-09 01:58:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-09 01:58:37,556 INFO L78 Accepts]: Start accepts. Automaton has has 194 states, 193 states have (on average 3.22279792746114) internal successors, (622), 194 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-03-09 01:58:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:37,558 INFO L225 Difference]: With dead ends: 782 [2025-03-09 01:58:37,558 INFO L226 Difference]: Without dead ends: 781 [2025-03-09 01:58:37,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27900 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=10228, Invalid=54542, Unknown=0, NotChecked=0, Total=64770 [2025-03-09 01:58:37,562 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1246 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:37,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 965 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:58:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-09 01:58:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 770. [2025-03-09 01:58:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 767 states have (on average 1.0521512385919165) internal successors, (807), 769 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 807 transitions. [2025-03-09 01:58:37,586 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 807 transitions. Word has length 208 [2025-03-09 01:58:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:37,587 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 807 transitions. [2025-03-09 01:58:37,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 194 states, 193 states have (on average 3.22279792746114) internal successors, (622), 194 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 807 transitions. [2025-03-09 01:58:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-09 01:58:37,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:37,588 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1] [2025-03-09 01:58:37,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-09 01:58:37,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:37,789 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:37,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:37,789 INFO L85 PathProgramCache]: Analyzing trace with hash -659005112, now seen corresponding path program 4 times [2025-03-09 01:58:37,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:37,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142329793] [2025-03-09 01:58:37,789 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:58:37,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:37,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 211 statements into 2 equivalence classes. [2025-03-09 01:58:37,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-09 01:58:37,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:58:37,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142329793] [2025-03-09 01:58:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142329793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93771708] [2025-03-09 01:58:39,432 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:58:39,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:39,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:39,434 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:39,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-09 01:58:39,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 211 statements into 2 equivalence classes. [2025-03-09 01:58:39,500 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-09 01:58:39,500 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:58:39,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:39,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-09 01:58:39,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:41,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93771708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:44,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:44,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 195 [2025-03-09 01:58:44,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917404506] [2025-03-09 01:58:44,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:44,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 196 states [2025-03-09 01:58:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:44,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2025-03-09 01:58:44,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=32558, Unknown=0, NotChecked=0, Total=38220 [2025-03-09 01:58:44,163 INFO L87 Difference]: Start difference. First operand 770 states and 807 transitions. Second operand has 196 states, 195 states have (on average 3.2205128205128206) internal successors, (628), 196 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:58:52,034 INFO L93 Difference]: Finished difference Result 805 states and 824 transitions. [2025-03-09 01:58:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-03-09 01:58:52,034 INFO L78 Accepts]: Start accepts. Automaton has has 196 states, 195 states have (on average 3.2205128205128206) internal successors, (628), 196 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-09 01:58:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:58:52,036 INFO L225 Difference]: With dead ends: 805 [2025-03-09 01:58:52,036 INFO L226 Difference]: Without dead ends: 804 [2025-03-09 01:58:52,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32709 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=12523, Invalid=68417, Unknown=0, NotChecked=0, Total=80940 [2025-03-09 01:58:52,039 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2185 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:58:52,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 1055 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:58:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-09 01:58:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 773. [2025-03-09 01:58:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 770 states have (on average 1.0324675324675325) internal successors, (795), 772 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 795 transitions. [2025-03-09 01:58:52,073 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 795 transitions. Word has length 211 [2025-03-09 01:58:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:58:52,074 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 795 transitions. [2025-03-09 01:58:52,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 196 states, 195 states have (on average 3.2205128205128206) internal successors, (628), 196 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:58:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 795 transitions. [2025-03-09 01:58:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-09 01:58:52,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:58:52,075 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1] [2025-03-09 01:58:52,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-09 01:58:52,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:52,277 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:58:52,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:58:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash -80586655, now seen corresponding path program 4 times [2025-03-09 01:58:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:58:52,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666771018] [2025-03-09 01:58:52,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:58:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:58:52,285 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 253 statements into 2 equivalence classes. [2025-03-09 01:58:52,314 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 253 of 253 statements. [2025-03-09 01:58:52,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:58:52,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:58:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666771018] [2025-03-09 01:58:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666771018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:58:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799729432] [2025-03-09 01:58:54,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:58:54,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:58:54,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:58:54,080 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:58:54,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-09 01:58:54,116 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 253 statements into 2 equivalence classes. [2025-03-09 01:58:54,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 253 of 253 statements. [2025-03-09 01:58:54,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:58:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:58:54,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-09 01:58:54,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:58:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:56,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:58:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 0 proven. 2717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:58:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799729432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:58:59,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:58:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 211 [2025-03-09 01:58:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536159984] [2025-03-09 01:58:59,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:58:59,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 212 states [2025-03-09 01:58:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:58:59,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2025-03-09 01:58:59,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5849, Invalid=38883, Unknown=0, NotChecked=0, Total=44732 [2025-03-09 01:58:59,987 INFO L87 Difference]: Start difference. First operand 773 states and 795 transitions. Second operand has 212 states, 211 states have (on average 3.5876777251184833) internal successors, (757), 212 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:59:07,642 INFO L93 Difference]: Finished difference Result 1144 states and 1207 transitions. [2025-03-09 01:59:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2025-03-09 01:59:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 212 states, 211 states have (on average 3.5876777251184833) internal successors, (757), 212 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2025-03-09 01:59:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:59:07,645 INFO L225 Difference]: With dead ends: 1144 [2025-03-09 01:59:07,645 INFO L226 Difference]: Without dead ends: 1143 [2025-03-09 01:59:07,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31717 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=11015, Invalid=67105, Unknown=0, NotChecked=0, Total=78120 [2025-03-09 01:59:07,647 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2658 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2658 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:59:07,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2658 Valid, 1541 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:59:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-09 01:59:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1115. [2025-03-09 01:59:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1112 states have (on average 1.0422661870503598) internal successors, (1159), 1114 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1159 transitions. [2025-03-09 01:59:07,675 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1159 transitions. Word has length 253 [2025-03-09 01:59:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:59:07,675 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1159 transitions. [2025-03-09 01:59:07,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 212 states, 211 states have (on average 3.5876777251184833) internal successors, (757), 212 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:59:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1159 transitions. [2025-03-09 01:59:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-09 01:59:07,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:59:07,677 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 1, 1, 1, 1] [2025-03-09 01:59:07,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-09 01:59:07,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:07,877 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:59:07,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:59:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash -412479393, now seen corresponding path program 3 times [2025-03-09 01:59:07,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:59:07,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467171931] [2025-03-09 01:59:07,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:59:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:59:07,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 365 statements into 33 equivalence classes. [2025-03-09 01:59:08,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) and asserted 365 of 365 statements. [2025-03-09 01:59:08,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2025-03-09 01:59:08,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:12,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:59:12,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467171931] [2025-03-09 01:59:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467171931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:59:12,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938087135] [2025-03-09 01:59:12,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:59:12,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:59:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:59:12,057 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:59:12,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-09 01:59:12,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 365 statements into 33 equivalence classes. [2025-03-09 01:59:12,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) and asserted 365 of 365 statements. [2025-03-09 01:59:12,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2025-03-09 01:59:12,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:59:12,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-03-09 01:59:12,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:59:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:17,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:59:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:59:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938087135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:59:23,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:59:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 301 [2025-03-09 01:59:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335375185] [2025-03-09 01:59:23,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:59:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 302 states [2025-03-09 01:59:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:59:23,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 302 interpolants. [2025-03-09 01:59:23,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11524, Invalid=79378, Unknown=0, NotChecked=0, Total=90902 [2025-03-09 01:59:23,602 INFO L87 Difference]: Start difference. First operand 1115 states and 1159 transitions. Second operand has 302 states, 301 states have (on average 3.6312292358803986) internal successors, (1093), 302 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)