./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/gcnr2008.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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-lit/gcnr2008.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 fdb248ef49e1ab3b05d5b0ae73a340b38ef25b27662d8a5cd45744a1950a5101 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:59:59,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:59:59,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:59:59,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:59:59,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:59:59,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:59:59,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:59:59,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:59:59,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:59:59,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:59:59,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:59:59,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:59:59,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:59:59,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:59:59,135 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:59:59,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:59:59,136 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:59:59,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:59:59,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:59:59,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:59:59,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:59:59,138 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 -> fdb248ef49e1ab3b05d5b0ae73a340b38ef25b27662d8a5cd45744a1950a5101 [2025-03-17 14:59:59,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:59:59,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:59:59,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:59:59,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:59:59,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:59:59,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gcnr2008.i [2025-03-17 15:00:00,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f9e200f/b793be77d03d4b299b808a2e7192245b/FLAG334490dd8 [2025-03-17 15:00:00,726 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:00:00,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gcnr2008.i [2025-03-17 15:00:00,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f9e200f/b793be77d03d4b299b808a2e7192245b/FLAG334490dd8 [2025-03-17 15:00:01,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f9e200f/b793be77d03d4b299b808a2e7192245b [2025-03-17 15:00:01,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:00:01,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:00:01,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:00:01,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:00:01,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:00:01,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01, skipping insertion in model container [2025-03-17 15:00:01,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:00:01,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:00:01,226 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:00:01,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:00:01,248 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:00:01,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01 WrapperNode [2025-03-17 15:00:01,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:00:01,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:00:01,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:00:01,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:00:01,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,269 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-03-17 15:00:01,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:00:01,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:00:01,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:00:01,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:00:01,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,292 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-17 15:00:01,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:00:01,297 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:00:01,297 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:00:01,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:00:01,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (1/1) ... [2025-03-17 15:00:01,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:00:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:01,345 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-17 15:00:01,348 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-17 15:00:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:00:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:00:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:00:01,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:00:01,414 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:00:01,415 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:00:01,566 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 15:00:01,566 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:00:01,573 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:00:01,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:00:01,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:01 BoogieIcfgContainer [2025-03-17 15:00:01,574 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:00:01,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:00:01,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:00:01,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:00:01,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:00:01" (1/3) ... [2025-03-17 15:00:01,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1844a5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:01, skipping insertion in model container [2025-03-17 15:00:01,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:01" (2/3) ... [2025-03-17 15:00:01,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1844a5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:01, skipping insertion in model container [2025-03-17 15:00:01,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:01" (3/3) ... [2025-03-17 15:00:01,582 INFO L128 eAbstractionObserver]: Analyzing ICFG gcnr2008.i [2025-03-17 15:00:01,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:00:01,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcnr2008.i that has 1 procedures, 51 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-03-17 15:00:01,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:00:01,652 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;@237a8392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:00:01,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 15:00:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.84375) internal successors, (59), 50 states have internal predecessors, (59), 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-17 15:00:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:00:01,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:01,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:00:01,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 84869528, now seen corresponding path program 1 times [2025-03-17 15:00:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333705891] [2025-03-17 15:00:01,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:01,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:00:01,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:00:01,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:01,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:01,858 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-17 15:00:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333705891] [2025-03-17 15:00:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333705891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:01,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:00:01,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158890875] [2025-03-17 15:00:01,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:01,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:00:01,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:01,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:00:01,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:00:01,879 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.84375) internal successors, (59), 50 states have internal predecessors, (59), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:01,969 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2025-03-17 15:00:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:00:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:00:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:01,977 INFO L225 Difference]: With dead ends: 86 [2025-03-17 15:00:01,977 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 15:00:01,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:00:01,981 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 98 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:01,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 57 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 15:00:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2025-03-17 15:00:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 57 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-17 15:00:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2025-03-17 15:00:02,011 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 5 [2025-03-17 15:00:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,012 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2025-03-17 15:00:02,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:00:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2025-03-17 15:00:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:00:02,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:00:02,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1663983110, now seen corresponding path program 1 times [2025-03-17 15:00:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997219106] [2025-03-17 15:00:02,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:00:02,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:00:02,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,048 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-17 15:00:02,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997219106] [2025-03-17 15:00:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997219106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:02,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:02,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:00:02,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949376700] [2025-03-17 15:00:02,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:02,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:02,050 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 15:00:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,060 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2025-03-17 15:00:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 15:00:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,061 INFO L225 Difference]: With dead ends: 58 [2025-03-17 15:00:02,061 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 15:00:02,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 15:00:02,062 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 15:00:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 15:00:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 55 states have internal predecessors, (72), 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-17 15:00:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2025-03-17 15:00:02,066 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 6 [2025-03-17 15:00:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,066 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-03-17 15:00:02,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 15:00:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2025-03-17 15:00:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:00:02,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:00:02,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1664011939, now seen corresponding path program 1 times [2025-03-17 15:00:02,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861580458] [2025-03-17 15:00:02,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:00:02,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:00:02,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,103 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-17 15:00:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861580458] [2025-03-17 15:00:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861580458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:02,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:00:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018792166] [2025-03-17 15:00:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:00:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:00:02,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:00:02,104 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 15:00:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,193 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2025-03-17 15:00:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:00:02,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 15:00:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,194 INFO L225 Difference]: With dead ends: 95 [2025-03-17 15:00:02,196 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 15:00:02,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:00:02,197 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 78 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 102 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 15:00:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-03-17 15:00:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.59375) internal successors, (102), 76 states have internal predecessors, (102), 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-17 15:00:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2025-03-17 15:00:02,205 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 6 [2025-03-17 15:00:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2025-03-17 15:00:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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-17 15:00:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2025-03-17 15:00:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:00:02,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:00:02,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash -43868841, now seen corresponding path program 1 times [2025-03-17 15:00:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69477713] [2025-03-17 15:00:02,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:00:02,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:00:02,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,240 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-17 15:00:02,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69477713] [2025-03-17 15:00:02,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69477713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:00:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250838655] [2025-03-17 15:00:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:02,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:02,245 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 15:00:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,263 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2025-03-17 15:00:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:02,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-17 15:00:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,265 INFO L225 Difference]: With dead ends: 110 [2025-03-17 15:00:02,265 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 15:00:02,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 15:00:02,265 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 15:00:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-03-17 15:00:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 103 states have internal predecessors, (138), 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-17 15:00:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2025-03-17 15:00:02,276 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 7 [2025-03-17 15:00:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,276 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2025-03-17 15:00:02,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 15:00:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2025-03-17 15:00:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:00:02,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:00:02,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash -44762570, now seen corresponding path program 1 times [2025-03-17 15:00:02,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640834608] [2025-03-17 15:00:02,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:00:02,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:00:02,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,329 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-17 15:00:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640834608] [2025-03-17 15:00:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640834608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:02,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:00:02,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970335434] [2025-03-17 15:00:02,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:02,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:02,331 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 15:00:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,380 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2025-03-17 15:00:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:02,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-17 15:00:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,382 INFO L225 Difference]: With dead ends: 160 [2025-03-17 15:00:02,382 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 15:00:02,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 15:00:02,382 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 62 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 15:00:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2025-03-17 15:00:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 148 states have internal predecessors, (206), 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-17 15:00:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 206 transitions. [2025-03-17 15:00:02,391 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 206 transitions. Word has length 7 [2025-03-17 15:00:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 206 transitions. [2025-03-17 15:00:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 15:00:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 206 transitions. [2025-03-17 15:00:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 15:00:02,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:00:02,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1387639685, now seen corresponding path program 1 times [2025-03-17 15:00:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411640080] [2025-03-17 15:00:02,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 15:00:02,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 15:00:02,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,420 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-17 15:00:02,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411640080] [2025-03-17 15:00:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411640080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:02,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:02,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:00:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134589251] [2025-03-17 15:00:02,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:02,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:02,422 INFO L87 Difference]: Start difference. First operand 149 states and 206 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 15:00:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,443 INFO L93 Difference]: Finished difference Result 170 states and 233 transitions. [2025-03-17 15:00:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:02,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 15:00:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,444 INFO L225 Difference]: With dead ends: 170 [2025-03-17 15:00:02,444 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 15:00:02,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:02,445 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 38 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 15:00:02,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 130. [2025-03-17 15:00:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 120 states have (on average 1.425) internal successors, (171), 129 states have internal predecessors, (171), 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-17 15:00:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 171 transitions. [2025-03-17 15:00:02,457 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 171 transitions. Word has length 8 [2025-03-17 15:00:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,458 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 171 transitions. [2025-03-17 15:00:02,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-17 15:00:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 171 transitions. [2025-03-17 15:00:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 15:00:02,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:00:02,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash 775506962, now seen corresponding path program 1 times [2025-03-17 15:00:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230541791] [2025-03-17 15:00:02,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 15:00:02,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 15:00:02,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,543 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-17 15:00:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230541791] [2025-03-17 15:00:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230541791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:00:02,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722273965] [2025-03-17 15:00:02,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:00:02,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:00:02,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:00:02,545 INFO L87 Difference]: Start difference. First operand 130 states and 171 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 15:00:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,608 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2025-03-17 15:00:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:00:02,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-17 15:00:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,610 INFO L225 Difference]: With dead ends: 134 [2025-03-17 15:00:02,610 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 15:00:02,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:00:02,610 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 56 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 15:00:02,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2025-03-17 15:00:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 128 states have internal predecessors, (167), 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-17 15:00:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2025-03-17 15:00:02,616 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 9 [2025-03-17 15:00:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,616 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2025-03-17 15:00:02,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-17 15:00:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2025-03-17 15:00:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 15:00:02,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:00:02,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1729087977, now seen corresponding path program 1 times [2025-03-17 15:00:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359456983] [2025-03-17 15:00:02,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 15:00:02,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 15:00:02,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,652 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-17 15:00:02,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359456983] [2025-03-17 15:00:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359456983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:02,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:02,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:00:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212274275] [2025-03-17 15:00:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:00:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:00:02,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:00:02,653 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 15:00:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,686 INFO L93 Difference]: Finished difference Result 238 states and 312 transitions. [2025-03-17 15:00:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:00:02,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 15:00:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,687 INFO L225 Difference]: With dead ends: 238 [2025-03-17 15:00:02,687 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 15:00:02,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:00:02,688 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 15:00:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 15:00:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 130 states have internal predecessors, (168), 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-17 15:00:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 168 transitions. [2025-03-17 15:00:02,695 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 168 transitions. Word has length 10 [2025-03-17 15:00:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,695 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 168 transitions. [2025-03-17 15:00:02,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-17 15:00:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 168 transitions. [2025-03-17 15:00:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 15:00:02,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:00:02,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:02,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1515547117, now seen corresponding path program 1 times [2025-03-17 15:00:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:02,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175241661] [2025-03-17 15:00:02,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:02,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:00:02,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:00:02,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,743 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-17 15:00:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175241661] [2025-03-17 15:00:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175241661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56972468] [2025-03-17 15:00:02,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:02,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:02,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:02,746 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-17 15:00:02,747 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-17 15:00:02,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:00:02,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:00:02,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:02,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:02,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:00:02,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:02,822 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-17 15:00:02,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:02,855 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-17 15:00:02,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56972468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:02,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:02,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 15:00:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174058690] [2025-03-17 15:00:02,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:02,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:00:02,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:02,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:00:02,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:00:02,858 INFO L87 Difference]: Start difference. First operand 131 states and 168 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-17 15:00:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:02,897 INFO L93 Difference]: Finished difference Result 378 states and 495 transitions. [2025-03-17 15:00:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:00:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-17 15:00:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:02,900 INFO L225 Difference]: With dead ends: 378 [2025-03-17 15:00:02,900 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 15:00:02,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:00:02,901 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 168 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:02,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 158 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 15:00:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 358. [2025-03-17 15:00:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 349 states have (on average 1.3524355300859598) internal successors, (472), 357 states have internal predecessors, (472), 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-17 15:00:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 472 transitions. [2025-03-17 15:00:02,924 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 472 transitions. Word has length 16 [2025-03-17 15:00:02,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:02,924 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 472 transitions. [2025-03-17 15:00:02,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-17 15:00:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 472 transitions. [2025-03-17 15:00:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 15:00:02,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:02,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:02,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:00:03,125 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-17 15:00:03,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash -940001151, now seen corresponding path program 1 times [2025-03-17 15:00:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402549570] [2025-03-17 15:00:03,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:03,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:00:03,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:00:03,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:03,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:03,224 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-17 15:00:03,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402549570] [2025-03-17 15:00:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402549570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:03,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915150851] [2025-03-17 15:00:03,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:03,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:03,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:03,226 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-17 15:00:03,228 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-17 15:00:03,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:00:03,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:00:03,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:03,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:03,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:00:03,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:03,307 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-17 15:00:03,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:03,362 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-17 15:00:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915150851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:03,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:03,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 15:00:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143711093] [2025-03-17 15:00:03,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:03,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:00:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:03,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:00:03,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:00:03,364 INFO L87 Difference]: Start difference. First operand 358 states and 472 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-17 15:00:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:03,530 INFO L93 Difference]: Finished difference Result 1149 states and 1533 transitions. [2025-03-17 15:00:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:00:03,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-17 15:00:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:03,534 INFO L225 Difference]: With dead ends: 1149 [2025-03-17 15:00:03,534 INFO L226 Difference]: Without dead ends: 908 [2025-03-17 15:00:03,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:00:03,537 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 260 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:03,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 222 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-17 15:00:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 567. [2025-03-17 15:00:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 558 states have (on average 1.3279569892473118) internal successors, (741), 566 states have internal predecessors, (741), 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-17 15:00:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 741 transitions. [2025-03-17 15:00:03,557 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 741 transitions. Word has length 17 [2025-03-17 15:00:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:03,557 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 741 transitions. [2025-03-17 15:00:03,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-17 15:00:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 741 transitions. [2025-03-17 15:00:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:00:03,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:03,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 15:00:03,565 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-17 15:00:03,758 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-17 15:00:03,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:03,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1470450725, now seen corresponding path program 1 times [2025-03-17 15:00:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-17 15:00:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:03,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:00:03,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:00:03,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:03,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:03,842 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-17 15:00:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-17 15:00:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756146800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207023632] [2025-03-17 15:00:03,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:03,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:03,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:03,844 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-17 15:00:03,845 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-17 15:00:03,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:00:03,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:00:03,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:03,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:03,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:00:03,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:03,904 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-17 15:00:03,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:03,945 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-17 15:00:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207023632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:03,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2, 2] total 7 [2025-03-17 15:00:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058435566] [2025-03-17 15:00:03,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:03,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:00:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:03,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:00:03,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:00:03,946 INFO L87 Difference]: Start difference. First operand 567 states and 741 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-17 15:00:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:04,013 INFO L93 Difference]: Finished difference Result 667 states and 860 transitions. [2025-03-17 15:00:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:00:04,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-17 15:00:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:04,015 INFO L225 Difference]: With dead ends: 667 [2025-03-17 15:00:04,015 INFO L226 Difference]: Without dead ends: 666 [2025-03-17 15:00:04,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:00:04,016 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 171 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:04,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 162 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-17 15:00:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 635. [2025-03-17 15:00:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 626 states have (on average 1.3003194888178913) internal successors, (814), 634 states have internal predecessors, (814), 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-17 15:00:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 814 transitions. [2025-03-17 15:00:04,047 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 814 transitions. Word has length 19 [2025-03-17 15:00:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:04,047 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 814 transitions. [2025-03-17 15:00:04,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-17 15:00:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 814 transitions. [2025-03-17 15:00:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 15:00:04,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:04,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:04,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:00:04,248 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-17 15:00:04,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:04,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1372125637, now seen corresponding path program 1 times [2025-03-17 15:00:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:04,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394007260] [2025-03-17 15:00:04,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:04,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 15:00:04,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 15:00:04,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:04,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:04,261 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-17 15:00:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394007260] [2025-03-17 15:00:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394007260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:04,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:00:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863627796] [2025-03-17 15:00:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:04,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:04,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:04,262 INFO L87 Difference]: Start difference. First operand 635 states and 814 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 15:00:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:04,275 INFO L93 Difference]: Finished difference Result 987 states and 1283 transitions. [2025-03-17 15:00:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 15:00:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:04,277 INFO L225 Difference]: With dead ends: 987 [2025-03-17 15:00:04,277 INFO L226 Difference]: Without dead ends: 648 [2025-03-17 15:00:04,278 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-17 15:00:04,278 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:04,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-17 15:00:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2025-03-17 15:00:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 639 states have (on average 1.2848200312989044) internal successors, (821), 647 states have internal predecessors, (821), 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-17 15:00:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 821 transitions. [2025-03-17 15:00:04,289 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 821 transitions. Word has length 21 [2025-03-17 15:00:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:04,290 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 821 transitions. [2025-03-17 15:00:04,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-17 15:00:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 821 transitions. [2025-03-17 15:00:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 15:00:04,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:04,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:04,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:00:04,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:04,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1019905352, now seen corresponding path program 1 times [2025-03-17 15:00:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-03-17 15:00:04,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:04,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:00:04,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:00:04,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:04,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:04,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-03-17 15:00:04,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637036280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:04,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097345353] [2025-03-17 15:00:04,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:04,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:04,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:04,319 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-17 15:00:04,320 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-17 15:00:04,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:00:04,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:00:04,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:04,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:00:04,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:04,409 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-17 15:00:04,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:00:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097345353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:00:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-17 15:00:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886300119] [2025-03-17 15:00:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:04,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:00:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:04,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:00:04,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:00:04,411 INFO L87 Difference]: Start difference. First operand 648 states and 821 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-17 15:00:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:04,456 INFO L93 Difference]: Finished difference Result 1274 states and 1608 transitions. [2025-03-17 15:00:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:00:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-17 15:00:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:04,459 INFO L225 Difference]: With dead ends: 1274 [2025-03-17 15:00:04,459 INFO L226 Difference]: Without dead ends: 640 [2025-03-17 15:00:04,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:00:04,460 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:04,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 76 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-17 15:00:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 623. [2025-03-17 15:00:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 614 states have (on average 1.275244299674267) internal successors, (783), 622 states have internal predecessors, (783), 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-17 15:00:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 783 transitions. [2025-03-17 15:00:04,474 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 783 transitions. Word has length 23 [2025-03-17 15:00:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:04,475 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 783 transitions. [2025-03-17 15:00:04,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-17 15:00:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 783 transitions. [2025-03-17 15:00:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:00:04,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:04,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:04,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:00:04,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:04,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:04,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2001054372, now seen corresponding path program 1 times [2025-03-17 15:00:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:04,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487326396] [2025-03-17 15:00:04,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:04,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:00:04,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:00:04,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:04,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:00:04,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:04,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487326396] [2025-03-17 15:00:04,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487326396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:04,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708554308] [2025-03-17 15:00:04,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:04,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:04,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:04,713 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-17 15:00:04,714 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-17 15:00:04,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:00:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:00:04,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:04,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:04,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:00:04,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:04,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708554308] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:04,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:00:04,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 5] total 11 [2025-03-17 15:00:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978218947] [2025-03-17 15:00:04,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:04,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:00:04,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:04,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:00:04,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:00:04,919 INFO L87 Difference]: Start difference. First operand 623 states and 783 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 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-17 15:00:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:05,008 INFO L93 Difference]: Finished difference Result 1207 states and 1527 transitions. [2025-03-17 15:00:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:00:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 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) Word has length 34 [2025-03-17 15:00:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:05,011 INFO L225 Difference]: With dead ends: 1207 [2025-03-17 15:00:05,011 INFO L226 Difference]: Without dead ends: 954 [2025-03-17 15:00:05,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:00:05,014 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:05,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 167 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-03-17 15:00:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 837. [2025-03-17 15:00:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 828 states have (on average 1.2765700483091786) internal successors, (1057), 836 states have internal predecessors, (1057), 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-17 15:00:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1057 transitions. [2025-03-17 15:00:05,040 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1057 transitions. Word has length 34 [2025-03-17 15:00:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:05,040 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1057 transitions. [2025-03-17 15:00:05,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 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-17 15:00:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1057 transitions. [2025-03-17 15:00:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:00:05,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:05,042 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-17 15:00:05,048 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-17 15:00:05,242 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,SelfDestructingSolverStorable13 [2025-03-17 15:00:05,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:05,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2128550825, now seen corresponding path program 2 times [2025-03-17 15:00:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416463308] [2025-03-17 15:00:05,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:05,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 15:00:05,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:00:05,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:05,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:05,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416463308] [2025-03-17 15:00:05,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416463308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410988497] [2025-03-17 15:00:05,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:05,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:05,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:05,311 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-17 15:00:05,313 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-17 15:00:05,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-17 15:00:05,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:00:05,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:05,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:05,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:00:05,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:05,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410988497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:05,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 15:00:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523609468] [2025-03-17 15:00:05,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:05,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:00:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:05,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:00:05,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:00:05,483 INFO L87 Difference]: Start difference. First operand 837 states and 1057 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-17 15:00:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:05,593 INFO L93 Difference]: Finished difference Result 3174 states and 4183 transitions. [2025-03-17 15:00:05,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:00:05,593 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 43 [2025-03-17 15:00:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:05,604 INFO L225 Difference]: With dead ends: 3174 [2025-03-17 15:00:05,604 INFO L226 Difference]: Without dead ends: 3172 [2025-03-17 15:00:05,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:00:05,607 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 343 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:05,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 333 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2025-03-17 15:00:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 2994. [2025-03-17 15:00:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 2985 states have (on average 1.289782244556114) internal successors, (3850), 2993 states have internal predecessors, (3850), 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-17 15:00:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 3850 transitions. [2025-03-17 15:00:05,697 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 3850 transitions. Word has length 43 [2025-03-17 15:00:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:05,697 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 3850 transitions. [2025-03-17 15:00:05,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-17 15:00:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 3850 transitions. [2025-03-17 15:00:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:00:05,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:05,698 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:05,705 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-17 15:00:05,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:00:05,899 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:05,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash 860101736, now seen corresponding path program 1 times [2025-03-17 15:00:05,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:05,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564659695] [2025-03-17 15:00:05,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:05,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:05,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:00:05,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:00:05,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:05,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 15:00:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564659695] [2025-03-17 15:00:05,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564659695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737663410] [2025-03-17 15:00:05,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:05,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:05,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:05,935 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-17 15:00:05,937 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-17 15:00:05,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:00:05,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:00:05,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:05,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:00:05,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:06,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737663410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:06,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 13 [2025-03-17 15:00:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475936009] [2025-03-17 15:00:06,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:06,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 15:00:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:06,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 15:00:06,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:00:06,165 INFO L87 Difference]: Start difference. First operand 2994 states and 3850 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 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-17 15:00:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:06,722 INFO L93 Difference]: Finished difference Result 6479 states and 8382 transitions. [2025-03-17 15:00:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 15:00:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 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 43 [2025-03-17 15:00:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:06,737 INFO L225 Difference]: With dead ends: 6479 [2025-03-17 15:00:06,738 INFO L226 Difference]: Without dead ends: 5555 [2025-03-17 15:00:06,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1067, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 15:00:06,741 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 396 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:06,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 194 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:00:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2025-03-17 15:00:06,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 2212. [2025-03-17 15:00:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2206 states have (on average 1.285131459655485) internal successors, (2835), 2211 states have internal predecessors, (2835), 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-17 15:00:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 2835 transitions. [2025-03-17 15:00:06,817 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 2835 transitions. Word has length 43 [2025-03-17 15:00:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:06,817 INFO L471 AbstractCegarLoop]: Abstraction has 2212 states and 2835 transitions. [2025-03-17 15:00:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 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-17 15:00:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2835 transitions. [2025-03-17 15:00:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 15:00:06,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:06,818 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1] [2025-03-17 15:00:06,824 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-17 15:00:07,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:07,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:07,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1262973161, now seen corresponding path program 2 times [2025-03-17 15:00:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:07,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174430960] [2025-03-17 15:00:07,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:07,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 15:00:07,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:00:07,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:07,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:07,132 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-17 15:00:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174430960] [2025-03-17 15:00:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174430960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354244986] [2025-03-17 15:00:07,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:07,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:07,135 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-17 15:00:07,137 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-17 15:00:07,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-17 15:00:07,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:00:07,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:07,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:07,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:00:07,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:07,243 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-17 15:00:07,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:07,321 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-17 15:00:07,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354244986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:07,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:07,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2025-03-17 15:00:07,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249788740] [2025-03-17 15:00:07,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:07,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:00:07,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:07,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:00:07,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:00:07,322 INFO L87 Difference]: Start difference. First operand 2212 states and 2835 transitions. Second operand has 17 states, 16 states have (on average 8.375) internal successors, (134), 16 states have internal predecessors, (134), 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-17 15:00:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:07,430 INFO L93 Difference]: Finished difference Result 2378 states and 3032 transitions. [2025-03-17 15:00:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:00:07,431 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 8.375) internal successors, (134), 16 states have internal predecessors, (134), 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 46 [2025-03-17 15:00:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:07,437 INFO L225 Difference]: With dead ends: 2378 [2025-03-17 15:00:07,438 INFO L226 Difference]: Without dead ends: 2377 [2025-03-17 15:00:07,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:00:07,439 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 575 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:07,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 401 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-17 15:00:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2357. [2025-03-17 15:00:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2351 states have (on average 1.2415993194385369) internal successors, (2919), 2356 states have internal predecessors, (2919), 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-17 15:00:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 2919 transitions. [2025-03-17 15:00:07,493 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 2919 transitions. Word has length 46 [2025-03-17 15:00:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:07,493 INFO L471 AbstractCegarLoop]: Abstraction has 2357 states and 2919 transitions. [2025-03-17 15:00:07,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 8.375) internal successors, (134), 16 states have internal predecessors, (134), 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-17 15:00:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 2919 transitions. [2025-03-17 15:00:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 15:00:07,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:07,495 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:07,503 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-17 15:00:07,695 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,SelfDestructingSolverStorable16 [2025-03-17 15:00:07,695 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:07,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:07,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1777768342, now seen corresponding path program 1 times [2025-03-17 15:00:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:07,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595526031] [2025-03-17 15:00:07,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:07,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:07,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:00:07,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:00:07,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:07,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595526031] [2025-03-17 15:00:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595526031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666117323] [2025-03-17 15:00:07,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:07,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:07,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:07,803 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-17 15:00:07,804 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-17 15:00:07,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:00:07,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:00:07,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:07,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:07,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:00:07,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:07,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666117323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:07,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:07,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 15:00:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604195305] [2025-03-17 15:00:07,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:07,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:00:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:07,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:00:07,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:00:07,994 INFO L87 Difference]: Start difference. First operand 2357 states and 2919 transitions. Second operand has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 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-17 15:00:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:08,174 INFO L93 Difference]: Finished difference Result 8359 states and 10561 transitions. [2025-03-17 15:00:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:00:08,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 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-17 15:00:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:08,188 INFO L225 Difference]: With dead ends: 8359 [2025-03-17 15:00:08,189 INFO L226 Difference]: Without dead ends: 6522 [2025-03-17 15:00:08,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:00:08,193 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 564 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:08,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 298 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6522 states. [2025-03-17 15:00:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6522 to 3134. [2025-03-17 15:00:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 3128 states have (on average 1.2266624040920715) internal successors, (3837), 3133 states have internal predecessors, (3837), 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-17 15:00:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 3837 transitions. [2025-03-17 15:00:08,278 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 3837 transitions. Word has length 52 [2025-03-17 15:00:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:08,278 INFO L471 AbstractCegarLoop]: Abstraction has 3134 states and 3837 transitions. [2025-03-17 15:00:08,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.153846153846153) internal successors, (145), 14 states have internal predecessors, (145), 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-17 15:00:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 3837 transitions. [2025-03-17 15:00:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 15:00:08,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:08,281 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2025-03-17 15:00:08,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:00:08,482 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-17 15:00:08,482 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:08,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1728462551, now seen corresponding path program 3 times [2025-03-17 15:00:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178400211] [2025-03-17 15:00:08,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:00:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:08,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 11 equivalence classes. [2025-03-17 15:00:08,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 15:00:08,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:00:08,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:08,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:08,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178400211] [2025-03-17 15:00:08,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178400211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:08,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357490068] [2025-03-17 15:00:08,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:00:08,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:08,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:08,643 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-17 15:00:08,645 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-17 15:00:08,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 11 equivalence classes. [2025-03-17 15:00:08,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 15:00:08,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:00:08,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:08,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:00:08,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:08,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357490068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:09,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 15:00:09,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758860404] [2025-03-17 15:00:09,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:09,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 15:00:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:09,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 15:00:09,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:00:09,013 INFO L87 Difference]: Start difference. First operand 3134 states and 3837 transitions. Second operand has 24 states, 23 states have (on average 8.434782608695652) internal successors, (194), 23 states have internal predecessors, (194), 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-17 15:00:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:09,284 INFO L93 Difference]: Finished difference Result 12290 states and 16069 transitions. [2025-03-17 15:00:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:00:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.434782608695652) internal successors, (194), 23 states have internal predecessors, (194), 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 97 [2025-03-17 15:00:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:09,310 INFO L225 Difference]: With dead ends: 12290 [2025-03-17 15:00:09,311 INFO L226 Difference]: Without dead ends: 12288 [2025-03-17 15:00:09,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:00:09,316 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1317 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:09,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 632 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12288 states. [2025-03-17 15:00:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12288 to 11927. [2025-03-17 15:00:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11927 states, 11921 states have (on average 1.2654978609177083) internal successors, (15086), 11926 states have internal predecessors, (15086), 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-17 15:00:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11927 states to 11927 states and 15086 transitions. [2025-03-17 15:00:09,554 INFO L78 Accepts]: Start accepts. Automaton has 11927 states and 15086 transitions. Word has length 97 [2025-03-17 15:00:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:09,554 INFO L471 AbstractCegarLoop]: Abstraction has 11927 states and 15086 transitions. [2025-03-17 15:00:09,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.434782608695652) internal successors, (194), 23 states have internal predecessors, (194), 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-17 15:00:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11927 states and 15086 transitions. [2025-03-17 15:00:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 15:00:09,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:09,558 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1] [2025-03-17 15:00:09,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 15:00:09,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:09,758 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash -237558633, now seen corresponding path program 3 times [2025-03-17 15:00:09,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-03-17 15:00:09,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:00:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:09,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-03-17 15:00:09,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:00:09,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:00:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232696962] [2025-03-17 15:00:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232696962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712830896] [2025-03-17 15:00:09,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:00:09,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:09,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:10,001 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-17 15:00:10,002 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-17 15:00:10,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 100 statements into 11 equivalence classes. [2025-03-17 15:00:10,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 15:00:10,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 15:00:10,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:10,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:00:10,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:10,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712830896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:10,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:10,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-17 15:00:10,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442773934] [2025-03-17 15:00:10,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:10,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 15:00:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:10,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 15:00:10,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:00:10,393 INFO L87 Difference]: Start difference. First operand 11927 states and 15086 transitions. Second operand has 25 states, 24 states have (on average 8.75) internal successors, (210), 24 states have internal predecessors, (210), 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-17 15:00:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:10,636 INFO L93 Difference]: Finished difference Result 12300 states and 15524 transitions. [2025-03-17 15:00:10,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:00:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 8.75) internal successors, (210), 24 states have internal predecessors, (210), 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 100 [2025-03-17 15:00:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:10,656 INFO L225 Difference]: With dead ends: 12300 [2025-03-17 15:00:10,656 INFO L226 Difference]: Without dead ends: 12299 [2025-03-17 15:00:10,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:00:10,662 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1005 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:10,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 662 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2025-03-17 15:00:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 12266. [2025-03-17 15:00:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12266 states, 12260 states have (on average 1.2239804241435563) internal successors, (15006), 12265 states have internal predecessors, (15006), 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-17 15:00:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 15006 transitions. [2025-03-17 15:00:10,897 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 15006 transitions. Word has length 100 [2025-03-17 15:00:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:10,897 INFO L471 AbstractCegarLoop]: Abstraction has 12266 states and 15006 transitions. [2025-03-17 15:00:10,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 8.75) internal successors, (210), 24 states have internal predecessors, (210), 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-17 15:00:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 15006 transitions. [2025-03-17 15:00:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 15:00:10,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:10,903 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1] [2025-03-17 15:00:10,909 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-17 15:00:11,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:11,103 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:11,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash 53338369, now seen corresponding path program 2 times [2025-03-17 15:00:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:11,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097716338] [2025-03-17 15:00:11,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:11,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes. [2025-03-17 15:00:11,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 15:00:11,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:11,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097716338] [2025-03-17 15:00:11,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097716338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627006396] [2025-03-17 15:00:11,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:11,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:11,358 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-17 15:00:11,360 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-17 15:00:11,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes. [2025-03-17 15:00:11,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 15:00:11,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:11,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:11,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:00:11,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:11,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627006396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:12,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:12,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2025-03-17 15:00:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416701577] [2025-03-17 15:00:12,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 15:00:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:12,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 15:00:12,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=773, Invalid=867, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 15:00:12,049 INFO L87 Difference]: Start difference. First operand 12266 states and 15006 transitions. Second operand has 41 states, 40 states have (on average 9.525) internal successors, (381), 40 states have internal predecessors, (381), 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-17 15:00:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:12,912 INFO L93 Difference]: Finished difference Result 32230 states and 40039 transitions. [2025-03-17 15:00:12,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-17 15:00:12,912 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 9.525) internal successors, (381), 40 states have internal predecessors, (381), 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 127 [2025-03-17 15:00:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:12,960 INFO L225 Difference]: With dead ends: 32230 [2025-03-17 15:00:12,960 INFO L226 Difference]: Without dead ends: 32227 [2025-03-17 15:00:12,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=813, Invalid=909, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 15:00:12,966 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2215 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:12,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 924 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:00:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32227 states. [2025-03-17 15:00:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32227 to 18081. [2025-03-17 15:00:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18081 states, 18075 states have (on average 1.22716459197787) internal successors, (22181), 18080 states have internal predecessors, (22181), 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-17 15:00:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18081 states to 18081 states and 22181 transitions. [2025-03-17 15:00:13,470 INFO L78 Accepts]: Start accepts. Automaton has 18081 states and 22181 transitions. Word has length 127 [2025-03-17 15:00:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:13,470 INFO L471 AbstractCegarLoop]: Abstraction has 18081 states and 22181 transitions. [2025-03-17 15:00:13,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 9.525) internal successors, (381), 40 states have internal predecessors, (381), 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-17 15:00:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 18081 states and 22181 transitions. [2025-03-17 15:00:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 15:00:13,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:13,488 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1] [2025-03-17 15:00:13,494 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-17 15:00:13,693 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,SelfDestructingSolverStorable20 [2025-03-17 15:00:13,693 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1402842153, now seen corresponding path program 4 times [2025-03-17 15:00:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759411991] [2025-03-17 15:00:13,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:00:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:13,699 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 205 statements into 2 equivalence classes. [2025-03-17 15:00:13,707 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 15:00:13,708 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:00:13,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2167 backedges. 0 proven. 2167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:14,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759411991] [2025-03-17 15:00:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759411991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006745591] [2025-03-17 15:00:14,118 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:00:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:14,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:14,120 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-17 15:00:14,121 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-17 15:00:14,150 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 205 statements into 2 equivalence classes. [2025-03-17 15:00:14,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 15:00:14,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:00:14,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:14,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:00:14,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2167 backedges. 0 proven. 2167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:14,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2167 backedges. 0 proven. 2167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006745591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:15,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:15,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 15:00:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087553160] [2025-03-17 15:00:15,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 15:00:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:15,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 15:00:15,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:00:15,011 INFO L87 Difference]: Start difference. First operand 18081 states and 22181 transitions. Second operand has 48 states, 47 states have (on average 8.72340425531915) internal successors, (410), 47 states have internal predecessors, (410), 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-17 15:00:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:16,330 INFO L93 Difference]: Finished difference Result 72433 states and 94950 transitions. [2025-03-17 15:00:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 15:00:16,330 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 8.72340425531915) internal successors, (410), 47 states have internal predecessors, (410), 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 205 [2025-03-17 15:00:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:16,422 INFO L225 Difference]: With dead ends: 72433 [2025-03-17 15:00:16,422 INFO L226 Difference]: Without dead ends: 72431 [2025-03-17 15:00:16,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:00:16,437 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 3587 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3587 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:16,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3587 Valid, 1280 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:00:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72431 states. [2025-03-17 15:00:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72431 to 70671. [2025-03-17 15:00:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70671 states, 70665 states have (on average 1.2655911696030566) internal successors, (89433), 70670 states have internal predecessors, (89433), 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-17 15:00:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70671 states to 70671 states and 89433 transitions. [2025-03-17 15:00:17,778 INFO L78 Accepts]: Start accepts. Automaton has 70671 states and 89433 transitions. Word has length 205 [2025-03-17 15:00:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:17,778 INFO L471 AbstractCegarLoop]: Abstraction has 70671 states and 89433 transitions. [2025-03-17 15:00:17,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 8.72340425531915) internal successors, (410), 47 states have internal predecessors, (410), 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-17 15:00:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 70671 states and 89433 transitions. [2025-03-17 15:00:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-17 15:00:17,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:17,796 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1] [2025-03-17 15:00:17,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 15:00:18,000 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,SelfDestructingSolverStorable21 [2025-03-17 15:00:18,000 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:18,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:18,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1753673623, now seen corresponding path program 4 times [2025-03-17 15:00:18,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640906841] [2025-03-17 15:00:18,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:00:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:18,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes. [2025-03-17 15:00:18,020 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 15:00:18,024 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:00:18,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 2277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:18,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640906841] [2025-03-17 15:00:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640906841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:18,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410342983] [2025-03-17 15:00:18,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:00:18,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:18,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:18,621 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-17 15:00:18,623 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-17 15:00:18,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 208 statements into 2 equivalence classes. [2025-03-17 15:00:18,694 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 15:00:18,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:00:18,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:18,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 15:00:18,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 2277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:18,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 2277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410342983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:19,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 15:00:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110321968] [2025-03-17 15:00:19,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:19,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 15:00:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:19,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 15:00:19,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:00:19,556 INFO L87 Difference]: Start difference. First operand 70671 states and 89433 transitions. Second operand has 48 states, 47 states have (on average 8.851063829787234) internal successors, (416), 47 states have internal predecessors, (416), 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-17 15:00:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:21,155 INFO L93 Difference]: Finished difference Result 71732 states and 90755 transitions. [2025-03-17 15:00:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 15:00:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 8.851063829787234) internal successors, (416), 47 states have internal predecessors, (416), 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-17 15:00:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:21,230 INFO L225 Difference]: With dead ends: 71732 [2025-03-17 15:00:21,230 INFO L226 Difference]: Without dead ends: 71731 [2025-03-17 15:00:21,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 15:00:21,252 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3168 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3168 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:21,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3168 Valid, 1328 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71731 states. [2025-03-17 15:00:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71731 to 71689. [2025-03-17 15:00:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71689 states, 71683 states have (on average 1.2242791177824588) internal successors, (87760), 71688 states have internal predecessors, (87760), 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-17 15:00:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71689 states to 71689 states and 87760 transitions. [2025-03-17 15:00:22,588 INFO L78 Accepts]: Start accepts. Automaton has 71689 states and 87760 transitions. Word has length 208 [2025-03-17 15:00:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:22,589 INFO L471 AbstractCegarLoop]: Abstraction has 71689 states and 87760 transitions. [2025-03-17 15:00:22,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 8.851063829787234) internal successors, (416), 47 states have internal predecessors, (416), 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-17 15:00:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71689 states and 87760 transitions. [2025-03-17 15:00:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-17 15:00:22,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:22,613 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 23, 23, 23, 23, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:22,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 15:00:22,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:22,814 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash -946080106, now seen corresponding path program 2 times [2025-03-17 15:00:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650783885] [2025-03-17 15:00:22,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:22,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-03-17 15:00:22,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 15:00:22,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:22,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 0 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:23,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:23,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650783885] [2025-03-17 15:00:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650783885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:23,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124994371] [2025-03-17 15:00:23,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:00:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:23,355 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-17 15:00:23,357 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-17 15:00:23,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-03-17 15:00:23,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 272 of 272 statements. [2025-03-17 15:00:23,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:00:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:23,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 15:00:23,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 0 proven. 3014 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 15:00:23,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 0 proven. 3014 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 15:00:24,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124994371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:24,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:24,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 50 [2025-03-17 15:00:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112832853] [2025-03-17 15:00:24,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:24,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 15:00:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:24,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 15:00:24,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 15:00:24,313 INFO L87 Difference]: Start difference. First operand 71689 states and 87760 transitions. Second operand has 52 states, 51 states have (on average 10.882352941176471) internal successors, (555), 51 states have internal predecessors, (555), 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-17 15:00:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:27,844 INFO L93 Difference]: Finished difference Result 222517 states and 274776 transitions. [2025-03-17 15:00:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-17 15:00:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 10.882352941176471) internal successors, (555), 51 states have internal predecessors, (555), 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 272 [2025-03-17 15:00:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:28,044 INFO L225 Difference]: With dead ends: 222517 [2025-03-17 15:00:28,044 INFO L226 Difference]: Without dead ends: 222514 [2025-03-17 15:00:28,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 15:00:28,069 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2938 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:28,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 1227 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:00:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222514 states. [2025-03-17 15:00:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222514 to 84072. [2025-03-17 15:00:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84072 states, 84066 states have (on average 1.2294387742963861) internal successors, (103354), 84071 states have internal predecessors, (103354), 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-17 15:00:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84072 states to 84072 states and 103354 transitions. [2025-03-17 15:00:30,258 INFO L78 Accepts]: Start accepts. Automaton has 84072 states and 103354 transitions. Word has length 272 [2025-03-17 15:00:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:30,258 INFO L471 AbstractCegarLoop]: Abstraction has 84072 states and 103354 transitions. [2025-03-17 15:00:30,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 10.882352941176471) internal successors, (555), 51 states have internal predecessors, (555), 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-17 15:00:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 84072 states and 103354 transitions. [2025-03-17 15:00:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-17 15:00:30,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:30,315 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1] [2025-03-17 15:00:30,324 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-17 15:00:30,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:30,519 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 15:00:30,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2034237993, now seen corresponding path program 5 times [2025-03-17 15:00:30,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:30,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892492914] [2025-03-17 15:00:30,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:00:30,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:30,529 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 421 statements into 47 equivalence classes. [2025-03-17 15:00:30,582 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 421 of 421 statements. [2025-03-17 15:00:30,582 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:00:30,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9499 backedges. 0 proven. 9499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892492914] [2025-03-17 15:00:32,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892492914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:32,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648032624] [2025-03-17 15:00:32,099 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:00:32,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:32,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:32,101 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-17 15:00:32,101 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-17 15:00:32,143 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 421 statements into 47 equivalence classes. [2025-03-17 15:00:32,242 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 421 of 421 statements. [2025-03-17 15:00:32,242 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 15:00:32,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:32,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 15:00:32,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9499 backedges. 0 proven. 9499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:32,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:00:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9499 backedges. 0 proven. 9499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648032624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:00:34,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:00:34,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-17 15:00:34,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590786970] [2025-03-17 15:00:34,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:00:34,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-17 15:00:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:34,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 15:00:34,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 15:00:34,661 INFO L87 Difference]: Start difference. First operand 84072 states and 103354 transitions. Second operand has 96 states, 95 states have (on average 8.863157894736842) internal successors, (842), 95 states have internal predecessors, (842), 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-17 15:00:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:44,570 INFO L93 Difference]: Finished difference Result 474391 states and 630549 transitions. [2025-03-17 15:00:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 15:00:44,570 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 8.863157894736842) internal successors, (842), 95 states have internal predecessors, (842), 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 421 [2025-03-17 15:00:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:45,162 INFO L225 Difference]: With dead ends: 474391 [2025-03-17 15:00:45,162 INFO L226 Difference]: Without dead ends: 474389 [2025-03-17 15:00:45,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 793 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 15:00:45,234 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8177 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8177 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:45,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8177 Valid, 2652 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:00:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474389 states.