./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/nla-digbench-scaling/ps2-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03c4946022d2e6f710dd6221d8af6a4ec932dc09e858917dba12290a0f27caf9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:18:31,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:18:31,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:18:31,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:18:31,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:18:31,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:18:31,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:18:31,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:18:31,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:18:31,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:18:31,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:18:31,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:18:31,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:18:31,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:18:31,728 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:18:31,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:18:31,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:18:31,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:18:31,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:18:31,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:18:31,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:18:31,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:18:31,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:18:31,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:18:31,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:18:31,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:18:31,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03c4946022d2e6f710dd6221d8af6a4ec932dc09e858917dba12290a0f27caf9 [2025-03-04 11:18:31,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:18:31,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:18:31,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:18:31,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:18:31,965 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:18:31,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_unwindbound5.c [2025-03-04 11:18:33,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7269cd288/384bb065627b4251b89aeb5679e36f9d/FLAGc4fe2eaf1 [2025-03-04 11:18:33,305 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:18:33,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps2-ll_unwindbound5.c [2025-03-04 11:18:33,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7269cd288/384bb065627b4251b89aeb5679e36f9d/FLAGc4fe2eaf1 [2025-03-04 11:18:33,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7269cd288/384bb065627b4251b89aeb5679e36f9d [2025-03-04 11:18:33,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:18:33,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:18:33,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:18:33,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:18:33,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:18:33,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33, skipping insertion in model container [2025-03-04 11:18:33,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:18:33,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:18:33,804 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:18:33,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:18:33,826 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:18:33,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33 WrapperNode [2025-03-04 11:18:33,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:18:33,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:18:33,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:18:33,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:18:33,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,849 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-03-04 11:18:33,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:18:33,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:18:33,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:18:33,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:18:33,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:18:33,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:18:33,881 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:18:33,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:18:33,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:18:33,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (1/1) ... [2025-03-04 11:18:33,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:18:33,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:33,907 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-04 11:18:33,913 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-04 11:18:33,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:18:33,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:18:33,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:18:33,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:18:33,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:18:33,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:18:33,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:18:33,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:18:34,107 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-04 11:18:34,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:18:34,116 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:18:34,117 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:18:34,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:18:34 BoogieIcfgContainer [2025-03-04 11:18:34,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:18:34,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:18:34,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:18:34,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:18:34,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:18:33" (1/3) ... [2025-03-04 11:18:34,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c394956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:18:34, skipping insertion in model container [2025-03-04 11:18:34,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:18:33" (2/3) ... [2025-03-04 11:18:34,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c394956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:18:34, skipping insertion in model container [2025-03-04 11:18:34,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:18:34" (3/3) ... [2025-03-04 11:18:34,124 INFO L128 eAbstractionObserver]: Analyzing ICFG ps2-ll_unwindbound5.c [2025-03-04 11:18:34,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:18:34,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps2-ll_unwindbound5.c that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 24 error locations. [2025-03-04 11:18:34,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:18:34,186 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;@3f5114de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:18:34,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 11:18:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 11:18:34,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:34,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 11:18:34,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:34,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2769503, now seen corresponding path program 1 times [2025-03-04 11:18:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335982174] [2025-03-04 11:18:34,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:34,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 11:18:34,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 11:18:34,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:34,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:34,325 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-04 11:18:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335982174] [2025-03-04 11:18:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335982174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:18:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:18:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778286721] [2025-03-04 11:18:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:34,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:18:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:34,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:18:34,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:18:34,343 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-04 11:18:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:34,397 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2025-03-04 11:18:34,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:18:34,399 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-04 11:18:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:34,403 INFO L225 Difference]: With dead ends: 129 [2025-03-04 11:18:34,403 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 11:18:34,405 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-04 11:18:34,407 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:34,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 11:18:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 11:18:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 57 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2025-03-04 11:18:34,437 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 4 [2025-03-04 11:18:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:34,438 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2025-03-04 11:18:34,438 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-04 11:18:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2025-03-04 11:18:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:18:34,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:34,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:34,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:18:34,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:34,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2105622373, now seen corresponding path program 1 times [2025-03-04 11:18:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619723299] [2025-03-04 11:18:34,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:34,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:18:34,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:18:34,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:34,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:18:34,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044039422] [2025-03-04 11:18:34,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:34,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:34,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:34,464 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-04 11:18:34,476 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-04 11:18:34,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:18:34,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:18:34,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:34,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:34,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:18:34,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:34,533 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-04 11:18:34,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:18:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619723299] [2025-03-04 11:18:34,534 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:18:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044039422] [2025-03-04 11:18:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044039422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:34,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:18:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:18:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156565699] [2025-03-04 11:18:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:34,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:18:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:34,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:18:34,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:18:34,536 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:18:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:34,615 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2025-03-04 11:18:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:18:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:18:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:34,616 INFO L225 Difference]: With dead ends: 92 [2025-03-04 11:18:34,616 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 11:18:34,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-04 11:18:34,616 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:34,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 11:18:34,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2025-03-04 11:18:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 72 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-03-04 11:18:34,621 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 8 [2025-03-04 11:18:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:34,621 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-03-04 11:18:34,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:18:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-03-04 11:18:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:18:34,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:34,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:34,628 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-04 11:18:34,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:34,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:34,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -849784108, now seen corresponding path program 1 times [2025-03-04 11:18:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880528387] [2025-03-04 11:18:34,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:34,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:18:34,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:18:34,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:34,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:34,862 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-04 11:18:34,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:34,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880528387] [2025-03-04 11:18:34,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880528387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:34,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:18:34,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:18:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099318185] [2025-03-04 11:18:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:34,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:18:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:34,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:18:34,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:18:34,863 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 11:18:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:34,924 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2025-03-04 11:18:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:18:34,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 11:18:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:34,925 INFO L225 Difference]: With dead ends: 94 [2025-03-04 11:18:34,925 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 11:18:34,925 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-04 11:18:34,926 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:34,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 11:18:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2025-03-04 11:18:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-03-04 11:18:34,930 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 9 [2025-03-04 11:18:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:34,931 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-03-04 11:18:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 11:18:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-03-04 11:18:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:18:34,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:34,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:34,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:18:34,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:34,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:34,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1381105961, now seen corresponding path program 1 times [2025-03-04 11:18:34,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:34,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304469604] [2025-03-04 11:18:34,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:34,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:18:34,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:18:34,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:34,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:34,990 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-04 11:18:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304469604] [2025-03-04 11:18:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304469604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:34,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:18:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:18:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627676967] [2025-03-04 11:18:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:34,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:18:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:34,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:18:34,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:18:34,991 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-04 11:18:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:35,094 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-03-04 11:18:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:18:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 11:18:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:35,095 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:18:35,095 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 11:18:35,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:18:35,096 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:35,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 11:18:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-03-04 11:18:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.510204081632653) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2025-03-04 11:18:35,101 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 12 [2025-03-04 11:18:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:35,102 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2025-03-04 11:18:35,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-04 11:18:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2025-03-04 11:18:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 11:18:35,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:35,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:35,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:18:35,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:35,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:35,103 INFO L85 PathProgramCache]: Analyzing trace with hash 92866451, now seen corresponding path program 1 times [2025-03-04 11:18:35,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:35,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904167872] [2025-03-04 11:18:35,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:35,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 11:18:35,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 11:18:35,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:35,155 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-04 11:18:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904167872] [2025-03-04 11:18:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904167872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:35,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:18:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:18:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554902324] [2025-03-04 11:18:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:35,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:18:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:35,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:18:35,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:18:35,157 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:35,181 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-04 11:18:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:18:35,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 11:18:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:35,182 INFO L225 Difference]: With dead ends: 76 [2025-03-04 11:18:35,182 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 11:18:35,182 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-04 11:18:35,183 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:35,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 11:18:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 11:18:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.469387755102041) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-03-04 11:18:35,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 21 [2025-03-04 11:18:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:35,195 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-04 11:18:35,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-03-04 11:18:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:18:35,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:35,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:35,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:18:35,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2084303473, now seen corresponding path program 1 times [2025-03-04 11:18:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352900144] [2025-03-04 11:18:35,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:35,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:18:35,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:18:35,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:35,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:35,289 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-04 11:18:35,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:35,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352900144] [2025-03-04 11:18:35,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352900144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:35,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:18:35,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:18:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870837950] [2025-03-04 11:18:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:35,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:18:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:35,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:18:35,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:18:35,290 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:35,356 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-04 11:18:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:18:35,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 11:18:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:35,357 INFO L225 Difference]: With dead ends: 77 [2025-03-04 11:18:35,357 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:18:35,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:18:35,358 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:35,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:18:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-04 11:18:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 71 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-03-04 11:18:35,368 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 25 [2025-03-04 11:18:35,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:35,368 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-03-04 11:18:35,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-03-04 11:18:35,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:18:35,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:35,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:35,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:18:35,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:35,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:35,371 INFO L85 PathProgramCache]: Analyzing trace with hash -188898233, now seen corresponding path program 1 times [2025-03-04 11:18:35,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:35,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352389336] [2025-03-04 11:18:35,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:35,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:18:35,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:18:35,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:35,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:35,449 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-04 11:18:35,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352389336] [2025-03-04 11:18:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352389336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:35,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:18:35,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:18:35,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526346865] [2025-03-04 11:18:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:35,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:18:35,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:35,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:18:35,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:18:35,451 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:35,511 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-03-04 11:18:35,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:18:35,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 11:18:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:35,512 INFO L225 Difference]: With dead ends: 77 [2025-03-04 11:18:35,513 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:18:35,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:18:35,513 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:35,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:18:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 11:18:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 72 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2025-03-04 11:18:35,522 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 26 [2025-03-04 11:18:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:35,522 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2025-03-04 11:18:35,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2025-03-04 11:18:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:18:35,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:35,523 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:35,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:18:35,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:35,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:35,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1142574619, now seen corresponding path program 1 times [2025-03-04 11:18:35,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:35,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483242690] [2025-03-04 11:18:35,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:35,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:35,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:18:35,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:18:35,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:35,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:35,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:35,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483242690] [2025-03-04 11:18:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483242690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:35,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604090721] [2025-03-04 11:18:35,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:35,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:35,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:35,603 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-04 11:18:35,604 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-04 11:18:35,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:18:35,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:18:35,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:35,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:35,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:18:35,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:35,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:18:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604090721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:35,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:18:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:18:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220975224] [2025-03-04 11:18:35,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:18:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:35,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:18:35,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:18:35,733 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:35,762 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2025-03-04 11:18:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:18:35,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 11:18:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:35,763 INFO L225 Difference]: With dead ends: 76 [2025-03-04 11:18:35,763 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 11:18:35,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:18:35,764 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:35,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 99 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 11:18:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 11:18:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 71 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-03-04 11:18:35,773 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 28 [2025-03-04 11:18:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:35,773 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-03-04 11:18:35,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-03-04 11:18:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:18:35,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:35,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:35,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:18:35,974 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,SelfDestructingSolverStorable7 [2025-03-04 11:18:35,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1060074798, now seen corresponding path program 1 times [2025-03-04 11:18:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669175164] [2025-03-04 11:18:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:35,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:18:35,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:18:35,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:35,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:36,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:36,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669175164] [2025-03-04 11:18:36,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669175164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:36,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531730735] [2025-03-04 11:18:36,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:36,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:36,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:36,039 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-04 11:18:36,040 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-04 11:18:36,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:18:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:18:36,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:36,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:36,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:18:36,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:36,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:18:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531730735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:36,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:18:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:18:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341800767] [2025-03-04 11:18:36,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:36,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:18:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:36,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:18:36,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:18:36,126 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:36,161 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2025-03-04 11:18:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:18:36,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 11:18:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:36,162 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:18:36,162 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 11:18:36,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:18:36,163 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 33 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:36,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 201 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 11:18:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2025-03-04 11:18:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.411764705882353) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-03-04 11:18:36,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 29 [2025-03-04 11:18:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:36,169 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-03-04 11:18:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-03-04 11:18:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:18:36,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:36,170 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:36,177 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-04 11:18:36,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:36,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:36,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash 206241057, now seen corresponding path program 1 times [2025-03-04 11:18:36,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:36,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833221777] [2025-03-04 11:18:36,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:36,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:18:36,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:18:36,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:36,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:18:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708554308] [2025-03-04 11:18:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:36,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:36,382 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-04 11:18:36,384 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-04 11:18:36,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:18:36,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:18:36,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:36,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:36,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:18:36,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:36,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833221777] [2025-03-04 11:18:36,539 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:18:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708554308] [2025-03-04 11:18:36,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708554308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:36,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:18:36,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 11:18:36,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635900195] [2025-03-04 11:18:36,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:36,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:18:36,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:36,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:18:36,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:18:36,544 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:36,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:36,664 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2025-03-04 11:18:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:18:36,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-03-04 11:18:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:36,665 INFO L225 Difference]: With dead ends: 152 [2025-03-04 11:18:36,665 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:18:36,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:18:36,666 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 95 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:36,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 119 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:18:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2025-03-04 11:18:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4536082474226804) internal successors, (141), 114 states have internal predecessors, (141), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:18:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2025-03-04 11:18:36,674 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 32 [2025-03-04 11:18:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:36,675 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2025-03-04 11:18:36,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2025-03-04 11:18:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:18:36,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:36,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:36,681 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-04 11:18:36,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:36,876 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:36,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2098505486, now seen corresponding path program 1 times [2025-03-04 11:18:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:36,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077311592] [2025-03-04 11:18:36,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:36,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:18:36,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:18:36,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:36,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077311592] [2025-03-04 11:18:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077311592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:36,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505531943] [2025-03-04 11:18:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:36,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:36,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:36,932 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-04 11:18:36,934 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-04 11:18:36,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:18:36,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:18:36,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:36,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:36,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:18:36,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:37,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:37,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505531943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:37,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:18:37,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:18:37,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80032925] [2025-03-04 11:18:37,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:37,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:18:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:37,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:18:37,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:18:37,099 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:18:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:37,204 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2025-03-04 11:18:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:18:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-04 11:18:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:37,206 INFO L225 Difference]: With dead ends: 120 [2025-03-04 11:18:37,206 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 11:18:37,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:18:37,207 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 74 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:37,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 100 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 11:18:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 11:18:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 111 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:18:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2025-03-04 11:18:37,217 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 33 [2025-03-04 11:18:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:37,217 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2025-03-04 11:18:37,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:18:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2025-03-04 11:18:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:18:37,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:37,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:37,223 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-04 11:18:37,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:18:37,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:37,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash 629160639, now seen corresponding path program 1 times [2025-03-04 11:18:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:37,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778020852] [2025-03-04 11:18:37,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:37,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:37,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:18:37,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:18:37,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:37,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:37,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:37,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778020852] [2025-03-04 11:18:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778020852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982934153] [2025-03-04 11:18:37,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:37,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:37,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:37,485 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-04 11:18:37,487 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-04 11:18:37,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:18:37,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:18:37,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:37,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:37,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:18:37,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:37,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:37,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982934153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:37,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:18:37,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 11:18:37,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906689065] [2025-03-04 11:18:37,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:18:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:37,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:18:37,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:18:37,647 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:18:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:37,765 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2025-03-04 11:18:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:18:37,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-03-04 11:18:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:37,766 INFO L225 Difference]: With dead ends: 134 [2025-03-04 11:18:37,766 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 11:18:37,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:18:37,766 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:37,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 11:18:37,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2025-03-04 11:18:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 111 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:18:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2025-03-04 11:18:37,771 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 34 [2025-03-04 11:18:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:37,771 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2025-03-04 11:18:37,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:18:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2025-03-04 11:18:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:18:37,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:37,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:37,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:18:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:37,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:37,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -967014307, now seen corresponding path program 1 times [2025-03-04 11:18:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:37,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013087703] [2025-03-04 11:18:37,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:37,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:18:37,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:18:37,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:37,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013087703] [2025-03-04 11:18:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013087703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226669371] [2025-03-04 11:18:38,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:38,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:38,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:38,060 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-04 11:18:38,061 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-04 11:18:38,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:18:38,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:18:38,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:38,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:18:38,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:18:38,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:18:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226669371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:38,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:18:38,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 11:18:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744082266] [2025-03-04 11:18:38,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:38,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:18:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:38,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:18:38,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:18:38,208 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:38,265 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2025-03-04 11:18:38,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:18:38,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-03-04 11:18:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:38,266 INFO L225 Difference]: With dead ends: 119 [2025-03-04 11:18:38,266 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 11:18:38,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:18:38,266 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:38,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 59 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:18:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 11:18:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 11:18:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 99 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:18:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2025-03-04 11:18:38,271 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 36 [2025-03-04 11:18:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:38,271 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2025-03-04 11:18:38,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:18:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2025-03-04 11:18:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:18:38,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:38,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:38,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:18:38,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:38,472 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:38,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:38,472 INFO L85 PathProgramCache]: Analyzing trace with hash -57289523, now seen corresponding path program 1 times [2025-03-04 11:18:38,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:38,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737308787] [2025-03-04 11:18:38,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:38,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:38,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:18:38,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:18:38,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:38,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:18:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737308787] [2025-03-04 11:18:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737308787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:38,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189541286] [2025-03-04 11:18:38,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:38,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:38,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:38,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:18:38,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:18:38,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:18:38,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:38,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:38,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:18:38,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:18:38,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:18:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189541286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:38,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:18:38,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:18:38,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671316731] [2025-03-04 11:18:38,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:38,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:18:38,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:38,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:18:38,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:18:38,584 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:38,596 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2025-03-04 11:18:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:18:38,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-03-04 11:18:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:38,598 INFO L225 Difference]: With dead ends: 105 [2025-03-04 11:18:38,598 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 11:18:38,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-04 11:18:38,598 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:38,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 11:18:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 11:18:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.10752688172043) internal successors, (103), 98 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:18:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2025-03-04 11:18:38,603 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 45 [2025-03-04 11:18:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:38,603 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2025-03-04 11:18:38,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2025-03-04 11:18:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:18:38,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:38,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:18:38,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:18:38,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:18:38,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1775975215, now seen corresponding path program 1 times [2025-03-04 11:18:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-04 11:18:38,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:38,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:18:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:18:38,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:38,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:18:38,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-04 11:18:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334140648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:38,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224532816] [2025-03-04 11:18:38,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:38,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:38,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:38,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:38,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:18:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:18:38,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:18:38,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:38,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:38,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:18:38,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:18:38,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:18:38,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224532816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:38,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:18:38,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:18:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60372753] [2025-03-04 11:18:38,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:38,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:18:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:38,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:18:38,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:18:38,988 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:18:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:39,013 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2025-03-04 11:18:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:18:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 46 [2025-03-04 11:18:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:39,014 INFO L225 Difference]: With dead ends: 120 [2025-03-04 11:18:39,014 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 11:18:39,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:18:39,015 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:39,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 11:18:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2025-03-04 11:18:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.088235294117647) internal successors, (111), 107 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:18:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2025-03-04 11:18:39,021 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 46 [2025-03-04 11:18:39,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:39,021 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2025-03-04 11:18:39,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.0) internal successors, (90), 7 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:18:39,021 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2025-03-04 11:18:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:18:39,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:39,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-04 11:18:39,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:18:39,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:18:39,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:39,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1700577197, now seen corresponding path program 1 times [2025-03-04 11:18:39,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230984181] [2025-03-04 11:18:39,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:39,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:18:39,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:18:39,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:39,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:18:39,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:39,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230984181] [2025-03-04 11:18:39,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230984181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:39,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864784557] [2025-03-04 11:18:39,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:18:39,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:39,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:39,319 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:39,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:18:39,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:18:39,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:18:39,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:18:39,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:39,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:18:39,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:18:39,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:18:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864784557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:39,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:18:39,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 11:18:39,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329584060] [2025-03-04 11:18:39,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:39,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:18:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:39,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:18:39,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:18:39,703 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:18:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:39,953 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2025-03-04 11:18:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:18:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 74 [2025-03-04 11:18:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:39,954 INFO L225 Difference]: With dead ends: 171 [2025-03-04 11:18:39,954 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 11:18:39,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-03-04 11:18:39,955 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:39,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 172 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:18:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 11:18:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2025-03-04 11:18:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 149 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:18:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2025-03-04 11:18:39,963 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 74 [2025-03-04 11:18:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2025-03-04 11:18:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:18:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2025-03-04 11:18:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 11:18:39,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:39,966 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 11:18:39,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:18:40,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:18:40,167 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:40,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1119941941, now seen corresponding path program 2 times [2025-03-04 11:18:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:40,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383206737] [2025-03-04 11:18:40,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:40,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 11:18:40,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:18:40,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:18:40,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:18:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383206737] [2025-03-04 11:18:40,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383206737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961981539] [2025-03-04 11:18:40,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:40,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:40,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:40,298 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:40,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:18:40,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 11:18:40,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:18:40,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:18:40,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:40,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:18:40,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:18:40,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:18:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961981539] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:40,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:18:40,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 11:18:40,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309521336] [2025-03-04 11:18:40,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:40,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 11:18:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:40,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 11:18:40,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:18:40,674 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:18:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:40,946 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2025-03-04 11:18:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:18:40,947 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 82 [2025-03-04 11:18:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:40,948 INFO L225 Difference]: With dead ends: 186 [2025-03-04 11:18:40,948 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 11:18:40,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=549, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:18:40,949 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:40,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 182 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:18:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 11:18:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2025-03-04 11:18:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.0921052631578947) internal successors, (166), 157 states have internal predecessors, (166), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:18:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2025-03-04 11:18:40,957 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 82 [2025-03-04 11:18:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:40,957 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2025-03-04 11:18:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 9.238095238095237) internal successors, (194), 22 states have internal predecessors, (194), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:18:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2025-03-04 11:18:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 11:18:40,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:40,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 11:18:40,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:18:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:18:41,159 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:41,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1367443123, now seen corresponding path program 2 times [2025-03-04 11:18:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363840971] [2025-03-04 11:18:41,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:41,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-04 11:18:41,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:18:41,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:18:41,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:18:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860481149] [2025-03-04 11:18:41,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:41,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:41,182 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:41,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:18:41,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-04 11:18:41,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:18:41,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:18:41,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:41,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:18:41,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:18:41,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:18:41,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:41,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363840971] [2025-03-04 11:18:41,513 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:18:41,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860481149] [2025-03-04 11:18:41,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860481149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:41,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:18:41,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 11:18:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332511165] [2025-03-04 11:18:41,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:41,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:18:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:41,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:18:41,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:18:41,514 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 12 states, 11 states have (on average 15.454545454545455) internal successors, (170), 12 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:18:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:41,783 INFO L93 Difference]: Finished difference Result 249 states and 272 transitions. [2025-03-04 11:18:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:18:41,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 15.454545454545455) internal successors, (170), 12 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 104 [2025-03-04 11:18:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:41,784 INFO L225 Difference]: With dead ends: 249 [2025-03-04 11:18:41,784 INFO L226 Difference]: Without dead ends: 241 [2025-03-04 11:18:41,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:18:41,785 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 143 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:41,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 363 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:18:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-04 11:18:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 224. [2025-03-04 11:18:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 207 states have (on average 1.0917874396135265) internal successors, (226), 212 states have internal predecessors, (226), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:18:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 246 transitions. [2025-03-04 11:18:41,791 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 246 transitions. Word has length 104 [2025-03-04 11:18:41,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:41,791 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 246 transitions. [2025-03-04 11:18:41,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 15.454545454545455) internal successors, (170), 12 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:18:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 246 transitions. [2025-03-04 11:18:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:18:41,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:41,792 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 11:18:41,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:18:41,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:18:41,996 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:41,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash 802825955, now seen corresponding path program 2 times [2025-03-04 11:18:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:41,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331070278] [2025-03-04 11:18:41,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:42,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-04 11:18:42,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 118 statements. [2025-03-04 11:18:42,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:18:42,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-04 11:18:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331070278] [2025-03-04 11:18:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331070278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40304891] [2025-03-04 11:18:42,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:42,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:42,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:42,018 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:42,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:18:42,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-04 11:18:42,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 118 statements. [2025-03-04 11:18:42,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:18:42,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:42,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:18:42,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-04 11:18:42,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:18:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-04 11:18:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40304891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:18:42,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:18:42,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 11:18:42,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677534024] [2025-03-04 11:18:42,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:18:42,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:18:42,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:42,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:18:42,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:18:42,241 INFO L87 Difference]: Start difference. First operand 224 states and 246 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:42,266 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2025-03-04 11:18:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:18:42,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2025-03-04 11:18:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:42,267 INFO L225 Difference]: With dead ends: 224 [2025-03-04 11:18:42,268 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 11:18:42,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:18:42,268 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 67 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:42,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 11:18:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 11:18:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 207 states have (on average 1.0628019323671498) internal successors, (220), 211 states have internal predecessors, (220), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:18:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 240 transitions. [2025-03-04 11:18:42,274 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 240 transitions. Word has length 118 [2025-03-04 11:18:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:42,275 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 240 transitions. [2025-03-04 11:18:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 240 transitions. [2025-03-04 11:18:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 11:18:42,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:42,275 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-04 11:18:42,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:18:42,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:42,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:42,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:42,476 INFO L85 PathProgramCache]: Analyzing trace with hash -520085397, now seen corresponding path program 2 times [2025-03-04 11:18:42,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:42,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-03-04 11:18:42,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:42,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:42,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-04 11:18:42,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:18:42,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:18:42,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:18:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-03-04 11:18:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057709066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912380916] [2025-03-04 11:18:42,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:18:42,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:42,770 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:42,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:18:42,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-04 11:18:42,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 170 statements. [2025-03-04 11:18:42,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:18:42,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:42,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:18:42,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:18:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-03-04 11:18:42,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:18:42,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912380916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:18:42,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:18:42,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 20 [2025-03-04 11:18:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268162598] [2025-03-04 11:18:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:18:42,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:18:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:18:42,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:18:42,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:18:42,930 INFO L87 Difference]: Start difference. First operand 223 states and 240 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:18:42,992 INFO L93 Difference]: Finished difference Result 225 states and 242 transitions. [2025-03-04 11:18:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:18:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 170 [2025-03-04 11:18:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:18:42,993 INFO L225 Difference]: With dead ends: 225 [2025-03-04 11:18:42,993 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 11:18:42,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:18:42,994 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:18:42,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 68 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:18:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 11:18:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2025-03-04 11:18:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 207 states have (on average 1.0434782608695652) internal successors, (216), 210 states have internal predecessors, (216), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:18:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 236 transitions. [2025-03-04 11:18:43,012 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 236 transitions. Word has length 170 [2025-03-04 11:18:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:18:43,012 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 236 transitions. [2025-03-04 11:18:43,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:18:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 236 transitions. [2025-03-04 11:18:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 11:18:43,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:18:43,013 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1] [2025-03-04 11:18:43,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:18:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:43,214 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:18:43,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:18:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1356442909, now seen corresponding path program 3 times [2025-03-04 11:18:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:18:43,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642642886] [2025-03-04 11:18:43,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:18:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:18:43,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 178 statements into 8 equivalence classes. [2025-03-04 11:18:43,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 11:18:43,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 11:18:43,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 11:18:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:18:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642642886] [2025-03-04 11:18:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642642886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:18:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865959318] [2025-03-04 11:18:43,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:18:43,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:18:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:18:43,559 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:18:43,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:18:43,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 178 statements into 8 equivalence classes. [2025-03-04 11:18:43,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 178 statements. [2025-03-04 11:18:43,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:18:43,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:18:43,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:18:43,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:17,417 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (mod (+ |ULTIMATE.start_main_~y~0#1| .cse0) 2) 0) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) .cse0) 2)))))) is different from true [2025-03-04 11:19:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2025-03-04 11:19:21,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:19:21,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865959318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:19:21,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:19:21,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-03-04 11:19:21,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827620500] [2025-03-04 11:19:21,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:19:21,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:19:21,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:21,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:19:21,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-03-04 11:19:21,443 INFO L87 Difference]: Start difference. First operand 222 states and 236 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:36,216 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 22 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 11:19:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:44,383 INFO L93 Difference]: Finished difference Result 224 states and 238 transitions. [2025-03-04 11:19:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:19:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 178 [2025-03-04 11:19:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:44,384 INFO L225 Difference]: With dead ends: 224 [2025-03-04 11:19:44,384 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 11:19:44,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=116, Invalid=641, Unknown=3, NotChecked=52, Total=812 [2025-03-04 11:19:44,385 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:44,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 63 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 109 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2025-03-04 11:19:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 11:19:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2025-03-04 11:19:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 203 states have (on average 1.0098522167487685) internal successors, (205), 204 states have internal predecessors, (205), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:19:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 225 transitions. [2025-03-04 11:19:44,398 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 225 transitions. Word has length 178 [2025-03-04 11:19:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:44,398 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 225 transitions. [2025-03-04 11:19:44,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:19:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 225 transitions. [2025-03-04 11:19:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 11:19:44,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:19:44,400 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-03-04 11:19:44,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:19:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:44,601 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-04 11:19:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:19:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1637536727, now seen corresponding path program 3 times [2025-03-04 11:19:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:19:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493346421] [2025-03-04 11:19:44,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:19:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:19:44,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 248 statements into 11 equivalence classes. [2025-03-04 11:19:44,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 11:19:44,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:19:44,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 896 proven. 64 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:19:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:19:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493346421] [2025-03-04 11:19:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493346421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:19:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709554628] [2025-03-04 11:19:45,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:19:45,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:19:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:19:45,585 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:19:45,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:19:45,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 248 statements into 11 equivalence classes. [2025-03-04 11:19:45,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 11:19:45,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 11:19:45,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:19:45,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 11:19:45,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:19:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 1130 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:19:46,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:19:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1140 backedges. 950 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 11:19:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709554628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:19:46,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:19:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23, 24] total 43 [2025-03-04 11:19:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341383634] [2025-03-04 11:19:46,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:19:46,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:19:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:19:46,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:19:46,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1316, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:19:46,511 INFO L87 Difference]: Start difference. First operand 216 states and 225 transitions. Second operand has 43 states, 43 states have (on average 8.093023255813954) internal successors, (348), 43 states have internal predecessors, (348), 15 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 15 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-04 11:19:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:19:46,720 INFO L93 Difference]: Finished difference Result 236 states and 240 transitions. [2025-03-04 11:19:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:19:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 8.093023255813954) internal successors, (348), 43 states have internal predecessors, (348), 15 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 15 states have call predecessors, (25), 15 states have call successors, (25) Word has length 248 [2025-03-04 11:19:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:19:46,723 INFO L225 Difference]: With dead ends: 236 [2025-03-04 11:19:46,723 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:19:46,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 473 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=636, Invalid=1716, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 11:19:46,724 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 18 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:19:46,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 814 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:19:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:19:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:19:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:19:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:19:46,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 248 [2025-03-04 11:19:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:19:46,725 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:19:46,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 8.093023255813954) internal successors, (348), 43 states have internal predecessors, (348), 15 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 15 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-04 11:19:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:19:46,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:19:46,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-04 11:19:46,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-04 11:19:46,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-04 11:19:46,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-04 11:19:46,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-04 11:19:46,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-04 11:19:46,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-04 11:19:46,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-04 11:19:46,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-04 11:19:46,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-04 11:19:46,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-04 11:19:46,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-04 11:19:46,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-04 11:19:46,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-04 11:19:46,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:19:46,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 11:19:46,933 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:19:46,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:20:07,188 WARN L286 SmtUtils]: Spent 20.20s on a formula simplification. DAG size of input: 75 DAG size of output: 66 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-04 11:20:07,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:20:07,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:20:07 BoogieIcfgContainer [2025-03-04 11:20:07,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:20:07,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:20:07,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:20:07,323 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:20:07,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:18:34" (3/4) ... [2025-03-04 11:20:07,325 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:20:07,330 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:20:07,336 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:20:07,337 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:20:07,337 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:20:07,337 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:20:07,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:20:07,404 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:20:07,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:20:07,405 INFO L158 Benchmark]: Toolchain (without parser) took 93716.26ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 114.0MB in the beginning and 104.0MB in the end (delta: 10.0MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2025-03-04 11:20:07,405 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:20:07,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.06ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 102.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:20:07,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.73ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.9MB in the end (delta: 995.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:20:07,406 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:20:07,406 INFO L158 Benchmark]: IcfgBuilder took 237.30ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 86.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:20:07,408 INFO L158 Benchmark]: TraceAbstraction took 93202.87ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 85.7MB in the beginning and 109.7MB in the end (delta: -24.0MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2025-03-04 11:20:07,408 INFO L158 Benchmark]: Witness Printer took 81.35ms. Allocated memory is still 243.3MB. Free memory was 109.7MB in the beginning and 104.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:20:07,409 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.06ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 102.9MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.73ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.9MB in the end (delta: 995.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 237.30ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 86.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 93202.87ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 85.7MB in the beginning and 109.7MB in the end (delta: -24.0MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * Witness Printer took 81.35ms. Allocated memory is still 243.3MB. Free memory was 109.7MB in the beginning and 104.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 72.8s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 915 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 3272 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 51 IncrementalHoareTripleChecker+Unchecked, 2384 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2291 IncrementalHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 888 mSDtfsCounter, 2291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2181 GetRequests, 1931 SyntacticMatches, 13 SemanticMatches, 237 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=18, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 121 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 43.2s InterpolantComputationTime, 2627 NumberOfCodeBlocks, 2147 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 3210 ConstructedInterpolants, 4 QuantifiedInterpolants, 12520 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1781 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 44 InterpolantComputations, 13 PerfectInterpolantSequences, 5386/7245 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((((((((((y == 4) && (c <= 9223372036854775806)) && (1 <= c)) && (k <= 2147483647)) && (x <= 10)) && (counter <= 5)) && (4 <= counter)) && (4 <= x)) || ((((((c == 1) && (k <= 2147483647)) && (x == 1)) && (1 <= counter)) && (y == 1)) && (counter <= 5))) || ((((((((c <= 9223372036854775806) && (1 <= c)) && (k <= 2147483647)) && (3 == y)) && (counter <= 5)) && (x <= 6)) && (3 <= x)) && (3 <= counter))) || (((((((((c <= 9223372036854775806) && (counter == 5)) && (1 <= y)) && ((((y + ((__int128) y * y)) >= 0) ? ((y + ((__int128) y * y)) % 2) : (((y + ((__int128) y * y)) % 2) + 2)) == 0)) && (x <= (y + (((((__int128) -1 * y) + ((__int128) y * y)) >= 0) ? ((((__int128) -1 * y) + ((__int128) y * y)) / 2) : (((((__int128) -1 * y) + ((__int128) y * y)) / 2) - 1))))) && (1 <= c)) && (k <= 2147483647)) && (y <= x)) && ((((__int128) y * 8) + ((__int128) y * y)) <= 9223372036854775791))) || ((((((((2 <= x) && (2 <= counter)) && (1 <= c)) && (k <= 2147483647)) && (2 == y)) && (x <= 3)) && (counter <= 5)) && (c <= 9223372036854775805))) || (((((c == 0) && (k <= 2147483647)) && (y == 0)) && (counter == 0)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:20:07,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE