./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/DivMinus.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-restricted-15/DivMinus.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 994e912bd4544afb34dfd80da3167326cad668e93cc9b8e5e1266c7e92b136ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:49:41,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:49:41,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:49:41,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:49:41,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:49:41,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:49:41,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:49:41,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:49:41,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:49:41,776 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:49:41,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:49:41,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:49:41,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:49:41,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:49:41,777 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:49:41,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:49:41,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:49:41,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:49:41,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:49:41,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:49:41,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:49:41,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:49:41,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:49:41,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:49:41,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:49:41,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:49:41,780 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 994e912bd4544afb34dfd80da3167326cad668e93cc9b8e5e1266c7e92b136ec [2025-03-17 14:49:42,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:49:42,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:49:42,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:49:42,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:49:42,030 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:49:42,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/DivMinus.c [2025-03-17 14:49:43,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db50fde6/785f236928fa4d089fc6cc657eb85d0c/FLAG49f03747a [2025-03-17 14:49:43,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:49:43,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/DivMinus.c [2025-03-17 14:49:43,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db50fde6/785f236928fa4d089fc6cc657eb85d0c/FLAG49f03747a [2025-03-17 14:49:43,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db50fde6/785f236928fa4d089fc6cc657eb85d0c [2025-03-17 14:49:43,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:49:43,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:49:43,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:49:43,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:49:43,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:49:43,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1974ab7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43, skipping insertion in model container [2025-03-17 14:49:43,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:49:43,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:49:43,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:49:43,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:49:43,689 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:49:43,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43 WrapperNode [2025-03-17 14:49:43,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:49:43,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:49:43,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:49:43,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:49:43,695 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:49:43" (1/1) ... [2025-03-17 14:49:43,697 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:49:43" (1/1) ... [2025-03-17 14:49:43,708 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-03-17 14:49:43,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:49:43,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:49:43,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:49:43,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:49:43,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,718 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:49:43,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:49:43,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:49:43,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:49:43,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:49:43,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (1/1) ... [2025-03-17 14:49:43,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:49:43,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:43,750 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:49:43,753 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:49:43,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:49:43,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:49:43,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:49:43,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:49:43,915 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 14:49:43,916 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:49:43,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:49:43,923 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:49:43,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:43 BoogieIcfgContainer [2025-03-17 14:49:43,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:49:43,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:49:43,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:49:43,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:49:43,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:49:43" (1/3) ... [2025-03-17 14:49:43,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fa57c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:43, skipping insertion in model container [2025-03-17 14:49:43,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:49:43" (2/3) ... [2025-03-17 14:49:43,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fa57c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:49:43, skipping insertion in model container [2025-03-17 14:49:43,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:49:43" (3/3) ... [2025-03-17 14:49:43,930 INFO L128 eAbstractionObserver]: Analyzing ICFG DivMinus.c [2025-03-17 14:49:43,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:49:43,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG DivMinus.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-17 14:49:43,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:49:43,990 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;@7ec45d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:49:43,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 14:49:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:49:43,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:43,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:49:43,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:44,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash 39688, now seen corresponding path program 1 times [2025-03-17 14:49:44,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:44,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738351780] [2025-03-17 14:49:44,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:44,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:49:44,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:49:44,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:44,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:44,129 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:49:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:44,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738351780] [2025-03-17 14:49:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738351780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:44,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:44,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:49:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702633775] [2025-03-17 14:49:44,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:44,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:44,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:44,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:44,154 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:49:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:44,178 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-03-17 14:49:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 14:49:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:44,184 INFO L225 Difference]: With dead ends: 12 [2025-03-17 14:49:44,185 INFO L226 Difference]: Without dead ends: 9 [2025-03-17 14:49:44,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:44,191 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:44,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-17 14:49:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-17 14:49:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 6 states have (on average 1.5) internal successors, (9), 8 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:49:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-17 14:49:44,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 3 [2025-03-17 14:49:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:44,221 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-17 14:49:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:49:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-17 14:49:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:49:44,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:44,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:49:44,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:49:44,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1230303, now seen corresponding path program 1 times [2025-03-17 14:49:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610954447] [2025-03-17 14:49:44,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:44,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:49:44,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:49:44,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:44,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:44,287 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:49:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610954447] [2025-03-17 14:49:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610954447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:49:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442257331] [2025-03-17 14:49:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:44,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:49:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:44,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:49:44,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:49:44,290 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:49:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:44,323 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2025-03-17 14:49:44,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:49:44,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:49:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:44,324 INFO L225 Difference]: With dead ends: 9 [2025-03-17 14:49:44,324 INFO L226 Difference]: Without dead ends: 8 [2025-03-17 14:49:44,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:49:44,325 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:44,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-03-17 14:49:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-17 14:49:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-17 14:49:44,328 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-17 14:49:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:44,328 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-17 14:49:44,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:49:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-17 14:49:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:49:44,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:44,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:49:44,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:49:44,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 38139366, now seen corresponding path program 1 times [2025-03-17 14:49:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197955323] [2025-03-17 14:49:44,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:44,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:49:44,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:49:44,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:44,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:44,376 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:49:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197955323] [2025-03-17 14:49:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197955323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:44,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:44,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:49:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662101032] [2025-03-17 14:49:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:44,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:44,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:44,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:44,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:44,379 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:49:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:44,388 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2025-03-17 14:49:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:49:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:44,389 INFO L225 Difference]: With dead ends: 8 [2025-03-17 14:49:44,390 INFO L226 Difference]: Without dead ends: 7 [2025-03-17 14:49:44,390 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:49:44,391 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:44,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-17 14:49:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-17 14:49:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-17 14:49:44,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-17 14:49:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:44,396 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-17 14:49:44,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:49:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-17 14:49:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:49:44,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:44,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:49:44,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:49:44,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:44,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1182320317, now seen corresponding path program 1 times [2025-03-17 14:49:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:44,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555608052] [2025-03-17 14:49:44,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:44,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:49:44,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:49:44,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:44,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:44,440 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:49:44,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555608052] [2025-03-17 14:49:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555608052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:49:44,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:49:44,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:49:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595018373] [2025-03-17 14:49:44,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:49:44,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:49:44,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:44,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:49:44,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:49:44,442 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:44,451 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-17 14:49:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:49:44,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:49:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:44,452 INFO L225 Difference]: With dead ends: 13 [2025-03-17 14:49:44,452 INFO L226 Difference]: Without dead ends: 12 [2025-03-17 14:49:44,453 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:49:44,454 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:44,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-17 14:49:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-17 14:49:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-17 14:49:44,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 6 [2025-03-17 14:49:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:44,458 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-17 14:49:44,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-17 14:49:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:49:44,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:44,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1] [2025-03-17 14:49:44,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:49:44,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:44,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash 627319818, now seen corresponding path program 1 times [2025-03-17 14:49:44,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:44,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982549285] [2025-03-17 14:49:44,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:49:44,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:49:44,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:44,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:44,509 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:49:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:44,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982549285] [2025-03-17 14:49:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982549285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:44,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257962011] [2025-03-17 14:49:44,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:49:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:44,514 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:49:44,516 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:49:44,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:49:44,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:49:44,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:49:44,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:44,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:49:44,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:44,599 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:49:44,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:44,637 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:49:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257962011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:44,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:49:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300263861] [2025-03-17 14:49:44,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:44,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:49:44,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:44,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:49:44,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:49:44,639 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:49:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:44,658 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-17 14:49:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:49:44,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:49:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:44,660 INFO L225 Difference]: With dead ends: 28 [2025-03-17 14:49:44,660 INFO L226 Difference]: Without dead ends: 27 [2025-03-17 14:49:44,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:49:44,660 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:44,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-17 14:49:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-17 14:49:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-17 14:49:44,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 11 [2025-03-17 14:49:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:44,666 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-17 14:49:44,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:49:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-17 14:49:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 14:49:44,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:44,667 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1] [2025-03-17 14:49:44,674 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:49:44,868 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:49:44,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:44,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1317252861, now seen corresponding path program 2 times [2025-03-17 14:49:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:44,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140790218] [2025-03-17 14:49:44,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:49:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:44,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:49:44,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:49:44,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:49:44,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140790218] [2025-03-17 14:49:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140790218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200051757] [2025-03-17 14:49:45,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:49:45,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:45,006 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:49:45,016 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:49:45,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:49:45,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:49:45,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:49:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:45,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:49:45,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:45,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200051757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:45,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:49:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291173794] [2025-03-17 14:49:45,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:45,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:49:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:45,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:49:45,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:49:45,219 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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:49:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:45,260 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-03-17 14:49:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:49:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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 26 [2025-03-17 14:49:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:45,261 INFO L225 Difference]: With dead ends: 58 [2025-03-17 14:49:45,262 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 14:49:45,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:49:45,263 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:45,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:49:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 14:49:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 14:49:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 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:49:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2025-03-17 14:49:45,270 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 26 [2025-03-17 14:49:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:45,270 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2025-03-17 14:49:45,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 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:49:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2025-03-17 14:49:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 14:49:45,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:45,271 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1] [2025-03-17 14:49:45,279 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:49:45,472 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,SelfDestructingSolverStorable5 [2025-03-17 14:49:45,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:45,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1604542627, now seen corresponding path program 3 times [2025-03-17 14:49:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708996278] [2025-03-17 14:49:45,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:49:45,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:45,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-17 14:49:45,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 14:49:45,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:49:45,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708996278] [2025-03-17 14:49:45,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708996278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775409359] [2025-03-17 14:49:45,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:49:45,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:45,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:45,763 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:49:45,764 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:49:45,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-03-17 14:49:45,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 14:49:45,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:49:45,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:45,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:49:45,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:45,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:46,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775409359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:46,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:46,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 14:49:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827634869] [2025-03-17 14:49:46,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:46,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 14:49:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:46,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 14:49:46,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:49:46,241 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 24 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 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:49:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:46,329 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2025-03-17 14:49:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:49:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 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 56 [2025-03-17 14:49:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:46,332 INFO L225 Difference]: With dead ends: 118 [2025-03-17 14:49:46,332 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 14:49:46,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:49:46,332 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:46,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:49:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 14:49:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 14:49:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.0086206896551724) internal successors, (117), 116 states have internal predecessors, (117), 0 states have call successors, (0), 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:49:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2025-03-17 14:49:46,347 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 56 [2025-03-17 14:49:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:46,348 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2025-03-17 14:49:46,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 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:49:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2025-03-17 14:49:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 14:49:46,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:46,350 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1] [2025-03-17 14:49:46,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:49:46,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:46,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1414936547, now seen corresponding path program 4 times [2025-03-17 14:49:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:46,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851371038] [2025-03-17 14:49:46,552 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:49:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:46,570 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-17 14:49:46,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 14:49:46,593 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:49:46,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:47,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851371038] [2025-03-17 14:49:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851371038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629845329] [2025-03-17 14:49:47,186 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:49:47,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:47,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:47,190 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:49:47,191 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:49:47,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-03-17 14:49:47,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 14:49:47,241 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:49:47,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:47,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 14:49:47,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:47,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629845329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:48,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 14:49:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947624806] [2025-03-17 14:49:48,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:48,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:49:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:48,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:49:48,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:49:48,171 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand has 48 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 47 states have internal predecessors, (232), 0 states have call successors, (0), 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:49:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:48,310 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2025-03-17 14:49:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 14:49:48,311 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 47 states have internal predecessors, (232), 0 states have call successors, (0), 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 116 [2025-03-17 14:49:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:48,312 INFO L225 Difference]: With dead ends: 238 [2025-03-17 14:49:48,312 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 14:49:48,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:49:48,313 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:48,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:49:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 14:49:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-03-17 14:49:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 1.0042372881355932) internal successors, (237), 236 states have internal predecessors, (237), 0 states have call successors, (0), 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:49:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2025-03-17 14:49:48,328 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 116 [2025-03-17 14:49:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:48,328 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2025-03-17 14:49:48,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 4.9361702127659575) internal successors, (232), 47 states have internal predecessors, (232), 0 states have call successors, (0), 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:49:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2025-03-17 14:49:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-17 14:49:48,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:48,330 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1] [2025-03-17 14:49:48,336 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:49:48,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:48,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:48,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1138309533, now seen corresponding path program 5 times [2025-03-17 14:49:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:48,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455297831] [2025-03-17 14:49:48,535 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:49:48,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:48,556 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-17 14:49:48,697 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 14:49:48,697 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 14:49:48,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:49:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455297831] [2025-03-17 14:49:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455297831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:49:50,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519411762] [2025-03-17 14:49:50,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:49:50,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:50,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:49:50,750 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:49:50,751 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:49:50,782 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-03-17 14:49:50,863 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 14:49:50,863 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 14:49:50,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:49:50,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 14:49:50,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:49:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:51,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:49:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:49:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519411762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:49:53,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:49:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-17 14:49:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692769898] [2025-03-17 14:49:53,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:49:53,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-17 14:49:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:49:53,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 14:49:53,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:49:53,956 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand has 96 states, 95 states have (on average 4.968421052631579) internal successors, (472), 95 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:49:54,307 INFO L93 Difference]: Finished difference Result 478 states and 525 transitions. [2025-03-17 14:49:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 14:49:54,308 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 4.968421052631579) internal successors, (472), 95 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2025-03-17 14:49:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:49:54,310 INFO L225 Difference]: With dead ends: 478 [2025-03-17 14:49:54,311 INFO L226 Difference]: Without dead ends: 477 [2025-03-17 14:49:54,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:49:54,315 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:49:54,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:49:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-17 14:49:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-03-17 14:49:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.0021008403361344) internal successors, (477), 476 states have internal predecessors, (477), 0 states have call successors, (0), 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:49:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2025-03-17 14:49:54,345 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 236 [2025-03-17 14:49:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:49:54,346 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 477 transitions. [2025-03-17 14:49:54,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 4.968421052631579) internal successors, (472), 95 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:49:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 477 transitions. [2025-03-17 14:49:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-17 14:49:54,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:49:54,354 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 1, 1] [2025-03-17 14:49:54,361 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:49:54,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:49:54,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:49:54,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:49:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash -3367779, now seen corresponding path program 6 times [2025-03-17 14:49:54,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:49:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616949639] [2025-03-17 14:49:54,556 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:49:54,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:49:54,573 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-03-17 14:49:54,688 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-03-17 14:49:54,689 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 14:49:54,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:50:00,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:50:00,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616949639] [2025-03-17 14:50:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616949639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:50:00,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104713060] [2025-03-17 14:50:00,028 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:50:00,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:50:00,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:50:00,030 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:50:00,033 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:50:00,080 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-03-17 14:50:00,328 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-03-17 14:50:00,328 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-17 14:50:00,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:00,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-17 14:50:00,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:50:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:50:00,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:50:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:50:09,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104713060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:50:09,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:50:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-03-17 14:50:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807797645] [2025-03-17 14:50:09,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:50:09,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-17 14:50:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:50:09,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-17 14:50:09,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 14:50:09,587 INFO L87 Difference]: Start difference. First operand 477 states and 477 transitions. Second operand has 192 states, 191 states have (on average 4.984293193717278) internal successors, (952), 191 states have internal predecessors, (952), 0 states have call successors, (0), 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:50:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:50:10,860 INFO L93 Difference]: Finished difference Result 958 states and 1053 transitions. [2025-03-17 14:50:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-17 14:50:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 4.984293193717278) internal successors, (952), 191 states have internal predecessors, (952), 0 states have call successors, (0), 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 476 [2025-03-17 14:50:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:50:10,864 INFO L225 Difference]: With dead ends: 958 [2025-03-17 14:50:10,864 INFO L226 Difference]: Without dead ends: 957 [2025-03-17 14:50:10,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-03-17 14:50:10,867 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:50:10,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:50:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-03-17 14:50:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2025-03-17 14:50:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.0010460251046025) internal successors, (957), 956 states have internal predecessors, (957), 0 states have call successors, (0), 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:50:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 957 transitions. [2025-03-17 14:50:10,897 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 957 transitions. Word has length 476 [2025-03-17 14:50:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:50:10,898 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 957 transitions. [2025-03-17 14:50:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 4.984293193717278) internal successors, (952), 191 states have internal predecessors, (952), 0 states have call successors, (0), 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:50:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 957 transitions. [2025-03-17 14:50:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2025-03-17 14:50:10,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:50:10,919 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 1, 1] [2025-03-17 14:50:10,929 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:50:11,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:50:11,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-17 14:50:11,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:50:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1878695267, now seen corresponding path program 7 times [2025-03-17 14:50:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:50:11,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445420845] [2025-03-17 14:50:11,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:50:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:50:11,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 956 statements into 1 equivalence classes. [2025-03-17 14:50:11,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 956 of 956 statements. [2025-03-17 14:50:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:50:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:50:33,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:50:33,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445420845] [2025-03-17 14:50:33,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445420845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:50:33,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696216165] [2025-03-17 14:50:33,735 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:50:33,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:50:33,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:50:33,737 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:50:33,739 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:50:33,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 956 statements into 1 equivalence classes. [2025-03-17 14:50:33,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 956 of 956 statements. [2025-03-17 14:50:33,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:50:33,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:50:33,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-17 14:50:33,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:50:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:50:34,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:51:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 90725 backedges. 0 proven. 90725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:51:08,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696216165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:51:08,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:51:08,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 382 [2025-03-17 14:51:08,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26616073] [2025-03-17 14:51:08,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:51:08,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-17 14:51:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:51:08,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-17 14:51:08,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-03-17 14:51:08,475 INFO L87 Difference]: Start difference. First operand 957 states and 957 transitions. Second operand has 384 states, 383 states have (on average 4.992167101827676) internal successors, (1912), 383 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)