./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/half_2.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-invgen/half_2.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 0b362a98d328467ff4a069dbed2be3429090ca070e60d49c76297e4bb94402b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:59:32,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:59:32,402 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:32,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:59:32,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:59:32,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:59:32,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:59:32,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:59:32,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:59:32,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:59:32,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:59:32,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:59:32,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:59:32,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:59:32,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:59:32,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:59:32,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:59:32,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:59:32,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:59:32,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:59:32,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:59:32,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:59:32,435 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 -> 0b362a98d328467ff4a069dbed2be3429090ca070e60d49c76297e4bb94402b7 [2025-03-17 14:59:32,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:59:32,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:59:32,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:59:32,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:59:32,667 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:59:32,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/half_2.i [2025-03-17 14:59:33,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba9e0438/fa0fd45ef71d4cf790327586b9bb6b6c/FLAGced8097c6 [2025-03-17 14:59:33,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:59:33,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/half_2.i [2025-03-17 14:59:33,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba9e0438/fa0fd45ef71d4cf790327586b9bb6b6c/FLAGced8097c6 [2025-03-17 14:59:34,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba9e0438/fa0fd45ef71d4cf790327586b9bb6b6c [2025-03-17 14:59:34,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:59:34,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:59:34,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:59:34,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:59:34,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:59:34,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380310b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34, skipping insertion in model container [2025-03-17 14:59:34,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:59:34,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:59:34,482 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:59:34,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:59:34,500 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:59:34,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34 WrapperNode [2025-03-17 14:59:34,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:59:34,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:59:34,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:59:34,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:59:34,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,519 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-03-17 14:59:34,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:59:34,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:59:34,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:59:34,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:59:34,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,535 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 14:59:34,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:59:34,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:59:34,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:59:34,542 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:59:34,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (1/1) ... [2025-03-17 14:59:34,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:59:34,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:34,567 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 14:59:34,570 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 14:59:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:59:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:59:34,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:59:34,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:59:34,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:59:34,628 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:59:34,760 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 14:59:34,760 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:59:34,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:59:34,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:59:34,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:34 BoogieIcfgContainer [2025-03-17 14:59:34,770 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:59:34,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:59:34,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:59:34,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:59:34,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:59:34" (1/3) ... [2025-03-17 14:59:34,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c154c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:34, skipping insertion in model container [2025-03-17 14:59:34,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:59:34" (2/3) ... [2025-03-17 14:59:34,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c154c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:59:34, skipping insertion in model container [2025-03-17 14:59:34,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:34" (3/3) ... [2025-03-17 14:59:34,778 INFO L128 eAbstractionObserver]: Analyzing ICFG half_2.i [2025-03-17 14:59:34,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:59:34,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG half_2.i that has 1 procedures, 32 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-17 14:59:34,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:59:34,832 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;@5792f31c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:59:34,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:59:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:59:34,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:34,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:59:34,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2184511, now seen corresponding path program 1 times [2025-03-17 14:59:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:34,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111563326] [2025-03-17 14:59:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:34,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:59:34,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:59:34,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:35,011 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 14:59:35,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:35,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111563326] [2025-03-17 14:59:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111563326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:35,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:35,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:59:35,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666388485] [2025-03-17 14:59:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:35,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:35,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:35,030 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:35,093 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-03-17 14:59:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 14:59:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:35,099 INFO L225 Difference]: With dead ends: 56 [2025-03-17 14:59:35,099 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 14:59:35,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:35,103 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:35,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 14:59:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-17 14:59:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 27 states have internal predecessors, (30), 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 14:59:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-03-17 14:59:35,126 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 4 [2025-03-17 14:59:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:35,126 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-03-17 14:59:35,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-03-17 14:59:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:59:35,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:35,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:59:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:59:35,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:35,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:35,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2184222, now seen corresponding path program 1 times [2025-03-17 14:59:35,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:35,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767445166] [2025-03-17 14:59:35,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:35,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:59:35,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:59:35,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:35,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:35,181 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 14:59:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767445166] [2025-03-17 14:59:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767445166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:35,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:59:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14902301] [2025-03-17 14:59:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:35,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:59:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:35,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:59:35,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:59:35,182 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:35,200 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-17 14:59:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:59:35,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 14:59:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:35,201 INFO L225 Difference]: With dead ends: 28 [2025-03-17 14:59:35,201 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 14:59:35,201 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 14:59:35,202 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:35,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 14:59:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 14:59:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 26 states have internal predecessors, (29), 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 14:59:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-03-17 14:59:35,207 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 4 [2025-03-17 14:59:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-03-17 14:59:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-03-17 14:59:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:59:35,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:35,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:59:35,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:59:35,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:35,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash 67719842, now seen corresponding path program 1 times [2025-03-17 14:59:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294253367] [2025-03-17 14:59:35,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:35,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:59:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:59:35,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:35,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:35,246 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 14:59:35,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:35,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294253367] [2025-03-17 14:59:35,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294253367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:35,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:35,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:59:35,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633005710] [2025-03-17 14:59:35,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:35,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:35,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:35,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:35,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:35,249 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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 14:59:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:35,274 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-03-17 14:59:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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 14:59:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:35,275 INFO L225 Difference]: With dead ends: 33 [2025-03-17 14:59:35,275 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:59:35,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:35,276 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:35,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:59:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-03-17 14:59:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 25 states have internal predecessors, (28), 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 14:59:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-17 14:59:35,283 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 5 [2025-03-17 14:59:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:35,283 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-17 14:59:35,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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 14:59:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-17 14:59:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:59:35,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:35,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:59:35,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:59:35,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:35,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash 67710873, now seen corresponding path program 1 times [2025-03-17 14:59:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:35,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436028297] [2025-03-17 14:59:35,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:35,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:59:35,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:59:35,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:35,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:35,363 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 14:59:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436028297] [2025-03-17 14:59:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436028297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:59:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309153068] [2025-03-17 14:59:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:59:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:35,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:59:35,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:35,365 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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 14:59:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:35,410 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2025-03-17 14:59:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:35,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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 14:59:35,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:35,413 INFO L225 Difference]: With dead ends: 45 [2025-03-17 14:59:35,413 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 14:59:35,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:35,414 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:35,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 14:59:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-03-17 14:59:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 37 states have internal predecessors, (44), 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 14:59:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-17 14:59:35,419 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 5 [2025-03-17 14:59:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:35,419 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-17 14:59:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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 14:59:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-17 14:59:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:59:35,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:35,419 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:35,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:59:35,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:35,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1677374110, now seen corresponding path program 1 times [2025-03-17 14:59:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512296685] [2025-03-17 14:59:35,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:35,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:59:35,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:59:35,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:35,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512296685] [2025-03-17 14:59:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512296685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644958769] [2025-03-17 14:59:35,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:35,541 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 14:59:35,542 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 14:59:35,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:59:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:59:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:35,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:59:35,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:35,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:35,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644958769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:35,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:35,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-17 14:59:35,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755895736] [2025-03-17 14:59:35,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:35,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 14:59:35,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:35,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 14:59:35,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:59:35,814 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 14:59:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:35,979 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-03-17 14:59:35,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:59:35,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 14:59:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:35,980 INFO L225 Difference]: With dead ends: 64 [2025-03-17 14:59:35,980 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 14:59:35,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:59:35,981 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:35,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 105 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 14:59:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2025-03-17 14:59:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 54 states have internal predecessors, (71), 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 14:59:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-03-17 14:59:35,991 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 9 [2025-03-17 14:59:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:35,991 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-03-17 14:59:35,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 14:59:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-03-17 14:59:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 14:59:35,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:35,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:35,999 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 14:59:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:36,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:36,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1983969395, now seen corresponding path program 1 times [2025-03-17 14:59:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149273877] [2025-03-17 14:59:36,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:36,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:59:36,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:59:36,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:36,275 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 14:59:36,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:36,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149273877] [2025-03-17 14:59:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149273877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:36,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:59:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631089194] [2025-03-17 14:59:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:59:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:36,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:59:36,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:59:36,277 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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 14:59:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:36,324 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-03-17 14:59:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:59:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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 14:59:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:36,325 INFO L225 Difference]: With dead ends: 63 [2025-03-17 14:59:36,325 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 14:59:36,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:59:36,326 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:36,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 14:59:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-17 14:59:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 60 states have internal predecessors, (77), 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 14:59:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2025-03-17 14:59:36,331 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 9 [2025-03-17 14:59:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:36,331 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2025-03-17 14:59:36,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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 14:59:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2025-03-17 14:59:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:59:36,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:36,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:59:36,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash 458980890, now seen corresponding path program 1 times [2025-03-17 14:59:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020640701] [2025-03-17 14:59:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:36,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:59:36,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:59:36,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:36,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020640701] [2025-03-17 14:59:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020640701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291788239] [2025-03-17 14:59:36,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:36,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:36,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:36,400 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 14:59:36,401 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 14:59:36,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:59:36,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:59:36,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:36,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:36,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:59:36,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:36,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291788239] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:36,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:59:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 9 [2025-03-17 14:59:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712181668] [2025-03-17 14:59:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:36,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:36,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:36,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:59:36,547 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 14:59:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:36,561 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2025-03-17 14:59:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:59:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 14:59:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:36,563 INFO L225 Difference]: With dead ends: 61 [2025-03-17 14:59:36,563 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 14:59:36,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:59:36,564 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:36,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 14:59:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-03-17 14:59:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 50 states have internal predecessors, (63), 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 14:59:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2025-03-17 14:59:36,572 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 10 [2025-03-17 14:59:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:36,572 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2025-03-17 14:59:36,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 14:59:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2025-03-17 14:59:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:59:36,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:36,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:36,579 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 14:59:36,773 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,SelfDestructingSolverStorable6 [2025-03-17 14:59:36,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:36,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1373509078, now seen corresponding path program 1 times [2025-03-17 14:59:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052132225] [2025-03-17 14:59:36,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:36,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:59:36,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:59:36,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:36,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:36,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052132225] [2025-03-17 14:59:36,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052132225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:36,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:36,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:59:36,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423910381] [2025-03-17 14:59:36,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:36,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:59:36,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:36,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:59:36,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:36,834 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 14:59:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:36,864 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2025-03-17 14:59:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:59:36,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 14:59:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:36,865 INFO L225 Difference]: With dead ends: 63 [2025-03-17 14:59:36,866 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 14:59:36,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:36,866 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:36,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 14:59:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2025-03-17 14:59:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 59 states have internal predecessors, (75), 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 14:59:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-17 14:59:36,874 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 10 [2025-03-17 14:59:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:36,874 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-17 14:59:36,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 14:59:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-17 14:59:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:59:36,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:36,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:59:36,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:59:36,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:36,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1343783740, now seen corresponding path program 1 times [2025-03-17 14:59:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:36,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243677398] [2025-03-17 14:59:36,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:36,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:59:36,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:59:36,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:36,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:36,905 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 14:59:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243677398] [2025-03-17 14:59:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243677398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516031829] [2025-03-17 14:59:36,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:36,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:36,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:36,907 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 14:59:36,909 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 14:59:36,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:59:36,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:59:36,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:36,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:36,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:59:36,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:36,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:59:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516031829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:59:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 14:59:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208305853] [2025-03-17 14:59:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:36,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:36,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:36,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:59:36,949 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:36,964 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2025-03-17 14:59:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:36,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:59:36,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:36,964 INFO L225 Difference]: With dead ends: 60 [2025-03-17 14:59:36,964 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 14:59:36,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 14:59:36,965 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:36,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 14:59:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 14:59:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 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 14:59:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-03-17 14:59:36,969 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 11 [2025-03-17 14:59:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:36,969 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-03-17 14:59:36,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:36,969 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-03-17 14:59:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:59:36,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:36,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:36,976 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 14:59:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:37,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:37,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash -370891567, now seen corresponding path program 1 times [2025-03-17 14:59:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655847160] [2025-03-17 14:59:37,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:37,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:59:37,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:59:37,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:37,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:37,217 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 14:59:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:37,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655847160] [2025-03-17 14:59:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655847160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:37,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:59:37,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:59:37,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485446349] [2025-03-17 14:59:37,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:37,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:59:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:37,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:59:37,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:37,218 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:37,243 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2025-03-17 14:59:37,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:59:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:59:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:37,244 INFO L225 Difference]: With dead ends: 75 [2025-03-17 14:59:37,244 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 14:59:37,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:59:37,245 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:37,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 14:59:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-03-17 14:59:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-03-17 14:59:37,253 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 11 [2025-03-17 14:59:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:37,253 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-03-17 14:59:37,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-03-17 14:59:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:59:37,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:37,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2025-03-17 14:59:37,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:59:37,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:37,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1292377023, now seen corresponding path program 1 times [2025-03-17 14:59:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:37,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787752002] [2025-03-17 14:59:37,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:37,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:59:37,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:59:37,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:37,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:37,276 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 14:59:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787752002] [2025-03-17 14:59:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787752002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452341879] [2025-03-17 14:59:37,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:37,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:37,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:37,279 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 14:59:37,281 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 14:59:37,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:59:37,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:59:37,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:37,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:37,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:59:37,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:37,335 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 14:59:37,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:37,361 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 14:59:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452341879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:37,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:37,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 14:59:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885872987] [2025-03-17 14:59:37,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:59:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:37,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:59:37,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:59:37,363 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 14:59:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:37,388 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-03-17 14:59:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:59:37,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:59:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:37,390 INFO L225 Difference]: With dead ends: 72 [2025-03-17 14:59:37,390 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 14:59:37,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:59:37,390 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:37,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 14:59:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 14:59:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 70 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2025-03-17 14:59:37,397 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 12 [2025-03-17 14:59:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2025-03-17 14:59:37,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 14:59:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2025-03-17 14:59:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:59:37,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:37,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:37,406 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 14:59:37,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:37,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:37,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash -422175116, now seen corresponding path program 1 times [2025-03-17 14:59:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246681507] [2025-03-17 14:59:37,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:37,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:59:37,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:59:37,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:37,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:37,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246681507] [2025-03-17 14:59:37,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246681507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341911773] [2025-03-17 14:59:37,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:37,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:37,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:37,670 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 14:59:37,671 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 14:59:37,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:59:37,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:59:37,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:37,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:37,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:59:37,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:37,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:37,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341911773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:37,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:37,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-17 14:59:37,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777995977] [2025-03-17 14:59:37,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:37,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:59:37,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:37,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:59:37,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:59:37,790 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:37,881 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2025-03-17 14:59:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:59:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 14:59:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:37,881 INFO L225 Difference]: With dead ends: 93 [2025-03-17 14:59:37,881 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 14:59:37,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:59:37,882 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:37,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:59:37,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 14:59:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 14:59:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 91 states have internal predecessors, (104), 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 14:59:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2025-03-17 14:59:37,886 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 14 [2025-03-17 14:59:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:37,887 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2025-03-17 14:59:37,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2025-03-17 14:59:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:59:37,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:37,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:37,893 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 14:59:38,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:59:38,092 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:38,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -202526731, now seen corresponding path program 1 times [2025-03-17 14:59:38,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:38,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727096045] [2025-03-17 14:59:38,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:38,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:59:38,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:59:38,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:38,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:38,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727096045] [2025-03-17 14:59:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727096045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022199107] [2025-03-17 14:59:38,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:38,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:38,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:38,161 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 14:59:38,163 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 14:59:38,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:59:38,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:59:38,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:38,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:38,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:59:38,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:38,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:59:38,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022199107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:38,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:59:38,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-03-17 14:59:38,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948292975] [2025-03-17 14:59:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:38,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:59:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:38,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:59:38,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:59:38,223 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:38,254 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2025-03-17 14:59:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:59:38,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 14:59:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:38,255 INFO L225 Difference]: With dead ends: 94 [2025-03-17 14:59:38,255 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 14:59:38,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:59:38,256 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:38,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 14:59:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2025-03-17 14:59:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 72 states have internal predecessors, (80), 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 14:59:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-03-17 14:59:38,260 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 15 [2025-03-17 14:59:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:38,260 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-03-17 14:59:38,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-03-17 14:59:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 14:59:38,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:38,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:38,266 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 14:59:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:38,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:38,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:38,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1551023020, now seen corresponding path program 1 times [2025-03-17 14:59:38,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:38,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827413182] [2025-03-17 14:59:38,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:38,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:38,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:59:38,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:59:38,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:38,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:38,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827413182] [2025-03-17 14:59:38,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827413182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001414459] [2025-03-17 14:59:38,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:38,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:38,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:38,562 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 14:59:38,563 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 14:59:38,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 14:59:38,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 14:59:38,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:38,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:38,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:59:38,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:59:38,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:59:38,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001414459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:38,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:59:38,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-17 14:59:38,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055542391] [2025-03-17 14:59:38,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:38,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:59:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:38,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:59:38,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:59:38,626 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:38,643 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2025-03-17 14:59:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:59:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-17 14:59:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:38,643 INFO L225 Difference]: With dead ends: 73 [2025-03-17 14:59:38,643 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 14:59:38,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:59:38,644 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:38,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 14:59:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2025-03-17 14:59:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 50 states have internal predecessors, (57), 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 14:59:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-03-17 14:59:38,651 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 18 [2025-03-17 14:59:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:38,651 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-03-17 14:59:38,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-03-17 14:59:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:59:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:38,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:38,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:38,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:38,853 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:38,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash 179469770, now seen corresponding path program 1 times [2025-03-17 14:59:38,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:38,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211578124] [2025-03-17 14:59:38,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:38,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:38,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:59:38,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:59:38,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:38,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211578124] [2025-03-17 14:59:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211578124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713159527] [2025-03-17 14:59:38,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:38,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:38,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:38,940 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 14:59:38,942 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 14:59:38,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:59:38,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:59:38,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:38,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:38,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:59:38,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:39,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:59:39,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713159527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:59:39,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:59:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 14:59:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941760724] [2025-03-17 14:59:39,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:59:39,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:59:39,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:39,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:59:39,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:59:39,011 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 14:59:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:39,031 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-03-17 14:59:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:59:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 14:59:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:39,032 INFO L225 Difference]: With dead ends: 51 [2025-03-17 14:59:39,032 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 14:59:39,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:59:39,033 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:39,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 14:59:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 14:59:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 49 states have internal predecessors, (56), 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 14:59:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-17 14:59:39,037 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 20 [2025-03-17 14:59:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:39,037 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-17 14:59:39,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 14:59:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-17 14:59:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 14:59:39,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:39,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:59:39,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:59:39,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:59:39,238 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:39,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1268595547, now seen corresponding path program 1 times [2025-03-17 14:59:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628204086] [2025-03-17 14:59:39,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:39,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:59:39,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:59:39,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:39,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:39,283 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 14:59:39,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:39,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628204086] [2025-03-17 14:59:39,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628204086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:39,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307520500] [2025-03-17 14:59:39,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:59:39,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:39,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:39,287 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 14:59:39,289 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 14:59:39,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:59:39,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:59:39,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:59:39,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:39,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:59:39,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:39,345 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 14:59:39,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:39,386 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 14:59:39,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307520500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:39,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:59:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268417199] [2025-03-17 14:59:39,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:59:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:39,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:59:39,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:59:39,387 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 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 14:59:39,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:39,425 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2025-03-17 14:59:39,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:59:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 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 21 [2025-03-17 14:59:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:39,426 INFO L225 Difference]: With dead ends: 78 [2025-03-17 14:59:39,426 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 14:59:39,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:59:39,426 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:39,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 14:59:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 14:59:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 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 14:59:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-03-17 14:59:39,433 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2025-03-17 14:59:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:39,433 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-03-17 14:59:39,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 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 14:59:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-03-17 14:59:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 14:59:39,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:39,434 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1] [2025-03-17 14:59:39,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:39,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:59:39,635 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:39,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1892455616, now seen corresponding path program 2 times [2025-03-17 14:59:39,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:39,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017911993] [2025-03-17 14:59:39,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:39,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:39,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:59:39,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 27 statements. [2025-03-17 14:59:39,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:39,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 14:59:39,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017911993] [2025-03-17 14:59:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017911993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807577820] [2025-03-17 14:59:39,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:39,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:39,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:39,655 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 14:59:39,656 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 14:59:39,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:59:39,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 27 statements. [2025-03-17 14:59:39,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:39,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:39,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:59:39,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 14:59:39,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 14:59:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807577820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:39,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 14:59:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749087511] [2025-03-17 14:59:39,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:39,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:59:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:39,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:59:39,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:59:39,735 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 14:59:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:39,757 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-03-17 14:59:39,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:59:39,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 27 [2025-03-17 14:59:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:39,758 INFO L225 Difference]: With dead ends: 77 [2025-03-17 14:59:39,758 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 14:59:39,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:59:39,758 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:39,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 14:59:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 14:59:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-03-17 14:59:39,762 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 27 [2025-03-17 14:59:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:39,762 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-03-17 14:59:39,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 14:59:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-03-17 14:59:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:59:39,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:39,763 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1] [2025-03-17 14:59:39,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:59:39,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:59:39,963 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:39,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:39,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1878680610, now seen corresponding path program 2 times [2025-03-17 14:59:39,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:39,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497363678] [2025-03-17 14:59:39,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:39,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:39,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:59:39,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:59:39,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:59:39,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497363678] [2025-03-17 14:59:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497363678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388365561] [2025-03-17 14:59:40,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:40,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:40,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:40,175 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 14:59:40,176 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 14:59:40,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:59:40,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:59:40,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:59:40,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:40,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 14:59:40,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:40,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:59:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388365561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:40,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 47 [2025-03-17 14:59:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341000723] [2025-03-17 14:59:40,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:59:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:40,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:59:40,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1872, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:59:40,844 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 48 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:41,370 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-03-17 14:59:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 14:59:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 14:59:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:41,371 INFO L225 Difference]: With dead ends: 87 [2025-03-17 14:59:41,371 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 14:59:41,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=633, Invalid=3399, Unknown=0, NotChecked=0, Total=4032 [2025-03-17 14:59:41,373 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:41,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 165 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:59:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 14:59:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 53. [2025-03-17 14:59:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 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 14:59:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2025-03-17 14:59:41,378 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 29 [2025-03-17 14:59:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:41,378 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2025-03-17 14:59:41,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:59:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2025-03-17 14:59:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 14:59:41,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:59:41,378 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-17 14:59:41,385 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 14:59:41,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:59:41,579 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 14:59:41,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:59:41,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1872409844, now seen corresponding path program 2 times [2025-03-17 14:59:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:59:41,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128108064] [2025-03-17 14:59:41,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:41,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:59:41,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 14:59:41,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 48 statements. [2025-03-17 14:59:41,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:41,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 14:59:41,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:59:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128108064] [2025-03-17 14:59:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128108064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:59:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407622450] [2025-03-17 14:59:41,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:59:41,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:41,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:59:41,618 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 14:59:41,619 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 14:59:41,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-17 14:59:41,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 48 statements. [2025-03-17 14:59:41,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:59:41,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:59:41,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:59:41,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:59:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 14:59:41,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:59:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 14:59:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407622450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:59:41,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:59:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2025-03-17 14:59:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178410830] [2025-03-17 14:59:41,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:59:41,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:59:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:59:41,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:59:41,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:59:41,848 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 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 14:59:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:59:41,943 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2025-03-17 14:59:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:59:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 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 48 [2025-03-17 14:59:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:59:41,943 INFO L225 Difference]: With dead ends: 103 [2025-03-17 14:59:41,943 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:59:41,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:59:41,944 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:59:41,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 26 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:59:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:59:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:59:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 14:59:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:59:41,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2025-03-17 14:59:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:59:41,945 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:59:41,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 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 14:59:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:59:41,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:59:41,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-17 14:59:41,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-17 14:59:41,953 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 14:59:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:59:42,150 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:59:42,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:59:42,511 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:59:42,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:59:42 BoogieIcfgContainer [2025-03-17 14:59:42,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:59:42,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:59:42,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:59:42,532 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:59:42,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:59:34" (3/4) ... [2025-03-17 14:59:42,534 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:59:42,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-17 14:59:42,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:59:42,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:59:42,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:59:42,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:59:42,616 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:59:42,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:59:42,616 INFO L158 Benchmark]: Toolchain (without parser) took 8267.70ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 77.5MB in the end (delta: 27.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2025-03-17 14:59:42,617 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:42,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.99ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 94.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:42,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.45ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:42,617 INFO L158 Benchmark]: Boogie Preprocessor took 21.21ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:42,617 INFO L158 Benchmark]: IcfgBuilder took 227.95ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 79.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:42,617 INFO L158 Benchmark]: TraceAbstraction took 7759.99ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 83.4MB in the end (delta: -5.3MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2025-03-17 14:59:42,618 INFO L158 Benchmark]: Witness Printer took 83.89ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 77.5MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:59:42,618 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.99ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 94.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.45ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.21ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 227.95ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 79.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7759.99ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 83.4MB in the end (delta: -5.3MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. * Witness Printer took 83.89ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 77.5MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 37 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 273 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 1256 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 906 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1587 IncrementalHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 350 mSDtfsCounter, 1587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=12, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 107 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 516 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 647 ConstructedInterpolants, 0 QuantifiedInterpolants, 2653 SizeOfPredicates, 14 NumberOfNonLiveVariables, 613 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 346/692 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: ((((((((((((0 <= k) && (n <= ((long long) 2 + k))) && (k <= 999999)) && (i <= 2147483643)) && (4 <= i)) && (0 <= (n + 2147483648))) || ((((((i <= 2147483645) && (0 <= ((long long) 2147483647 + k))) && (n <= ((long long) 3 + k))) && (k <= 999999)) && (6 <= i)) && (0 <= (n + 2147483648)))) || (((i == 0) && (k == n)) && (0 <= (n + 2147483648)))) || ((((((((long long) 5 + n) <= ((long long) i + k)) && (i <= 2147483645)) && (4 <= k)) && (k <= 999999)) && (2 <= i)) && (0 <= (n + 2147483648)))) || ((((((i <= 2147483645) && (0 <= ((long long) 2147483647 + k))) && (n <= ((long long) k + 4))) && (k <= 999999)) && (8 <= i)) && (0 <= (n + 2147483648)))) || (((((0 <= k) && (2 == i)) && (n <= ((long long) k + 1))) && (k <= 999999)) && (0 <= (n + 2147483648)))) && (n <= 1000000)) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: (((((((1 <= j) && (k <= 999999)) && (((n >= 0) ? (n / 2) : ((n / 2) - 1)) <= 2147483647)) && (j <= 2147483646)) && (n <= 1000000)) && (0 <= (n + 2147483648))) || (((((k <= 999999) && (((n >= 0) ? (n / 2) : ((n / 2) - 1)) <= 2147483647)) && (n <= 1000000)) && (j == 0)) && (0 <= (n + 2147483648)))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:59:42,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE