./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --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/loop-invgen/sendmail-close-angle.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:44:22,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:44:22,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:44:22,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:44:22,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:44:23,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:44:23,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:44:23,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:44:23,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:44:23,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:44:23,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:44:23,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:44:23,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:44:23,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:44:23,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:44:23,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:44:23,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:44:23,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:44:23,007 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 [2025-03-04 10:44:23,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:44:23,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:44:23,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:44:23,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:44:23,267 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:44:23,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-04 10:44:24,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ab1def8/e07a906e72344f4f930a3f5d12507c39/FLAGb04d37275 [2025-03-04 10:44:24,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:44:24,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-03-04 10:44:24,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ab1def8/e07a906e72344f4f930a3f5d12507c39/FLAGb04d37275 [2025-03-04 10:44:24,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ab1def8/e07a906e72344f4f930a3f5d12507c39 [2025-03-04 10:44:24,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:44:24,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:44:24,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:44:24,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:44:24,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:44:24,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:24,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a076f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24, skipping insertion in model container [2025-03-04 10:44:24,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:24,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:44:24,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:44:24,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:44:24,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:44:24,961 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:44:24,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24 WrapperNode [2025-03-04 10:44:24,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:44:24,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:44:24,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:44:24,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:44:24,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:24,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:24,988 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-04 10:44:24,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:44:24,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:44:24,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:44:24,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:44:24,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:24,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:24,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,013 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 10:44:25,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:44:25,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:44:25,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:44:25,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:44:25,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (1/1) ... [2025-03-04 10:44:25,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:44:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:25,057 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 10:44:25,060 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 10:44:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:44:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:44:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:44:25,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:44:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:44:25,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:44:25,129 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:44:25,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:44:25,326 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-04 10:44:25,326 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:44:25,334 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:44:25,334 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:44:25,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:25 BoogieIcfgContainer [2025-03-04 10:44:25,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:44:25,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:44:25,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:44:25,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:44:25,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:44:24" (1/3) ... [2025-03-04 10:44:25,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f1344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:44:25, skipping insertion in model container [2025-03-04 10:44:25,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:44:24" (2/3) ... [2025-03-04 10:44:25,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f1344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:44:25, skipping insertion in model container [2025-03-04 10:44:25,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:25" (3/3) ... [2025-03-04 10:44:25,347 INFO L128 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2025-03-04 10:44:25,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:44:25,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sendmail-close-angle.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-04 10:44:25,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:44:25,425 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;@244248f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:44:25,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 10:44:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 42 states have internal predecessors, (49), 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 10:44:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:44:25,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:25,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:44:25,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:25,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1840559368, now seen corresponding path program 1 times [2025-03-04 10:44:25,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:25,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508403] [2025-03-04 10:44:25,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:25,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:25,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:44:25,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:44:25,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:25,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:25,574 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 10:44:25,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508403] [2025-03-04 10:44:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:25,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657381776] [2025-03-04 10:44:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:25,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:25,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:25,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:25,599 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 42 states have internal predecessors, (49), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:25,657 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2025-03-04 10:44:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:44:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:25,664 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:44:25,664 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 10:44:25,668 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 10:44:25,672 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:25,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 73 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 10:44:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 10:44:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 34 states have internal predecessors, (35), 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 10:44:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-04 10:44:25,713 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 6 [2025-03-04 10:44:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:25,714 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-04 10:44:25,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-04 10:44:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:44:25,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:25,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:25,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:44:25,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1222765553, now seen corresponding path program 1 times [2025-03-04 10:44:25,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:25,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390712798] [2025-03-04 10:44:25,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:25,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:44:25,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:44:25,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:25,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:25,757 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 10:44:25,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:25,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390712798] [2025-03-04 10:44:25,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390712798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:25,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:25,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:44:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020862143] [2025-03-04 10:44:25,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:25,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:44:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:25,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:44:25,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:44:25,760 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:25,776 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-04 10:44:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:44:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:44:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:25,777 INFO L225 Difference]: With dead ends: 43 [2025-03-04 10:44:25,777 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 10:44:25,777 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 10:44:25,778 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:25,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 58 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 10:44:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 10:44:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.36) internal successors, (34), 33 states have internal predecessors, (34), 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 10:44:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-04 10:44:25,793 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 7 [2025-03-04 10:44:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:25,793 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-04 10:44:25,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:44:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-04 10:44:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:44:25,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:25,794 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:25,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:44:25,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash -366741336, now seen corresponding path program 1 times [2025-03-04 10:44:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595304413] [2025-03-04 10:44:25,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:25,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:25,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:44:25,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:44:25,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:25,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:44:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595304413] [2025-03-04 10:44:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595304413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386415260] [2025-03-04 10:44:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:25,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:25,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:25,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:25,921 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:25,979 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-03-04 10:44:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 10:44:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:25,980 INFO L225 Difference]: With dead ends: 55 [2025-03-04 10:44:25,980 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 10:44:25,981 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 10:44:25,981 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 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 10:44:25,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 10:44:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-03-04 10:44:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 38 states have internal predecessors, (42), 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 10:44:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-03-04 10:44:25,994 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 21 [2025-03-04 10:44:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:25,994 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-03-04 10:44:25,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-03-04 10:44:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:44:25,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:25,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:25,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:44:25,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:25,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash -508488273, now seen corresponding path program 1 times [2025-03-04 10:44:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883913925] [2025-03-04 10:44:25,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:26,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:44:26,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:44:26,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:26,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:44:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883913925] [2025-03-04 10:44:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883913925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:26,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402520181] [2025-03-04 10:44:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:26,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:26,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:26,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:26,068 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:26,106 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2025-03-04 10:44:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 10:44:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:26,108 INFO L225 Difference]: With dead ends: 57 [2025-03-04 10:44:26,108 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 10:44:26,108 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 10:44:26,109 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 123 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 10:44:26,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 123 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 10:44:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 10:44:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:44:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-03-04 10:44:26,116 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 22 [2025-03-04 10:44:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:26,117 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-03-04 10:44:26,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-03-04 10:44:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:44:26,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:26,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:26,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:44:26,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:26,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash -24493943, now seen corresponding path program 1 times [2025-03-04 10:44:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197570390] [2025-03-04 10:44:26,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:26,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:44:26,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:44:26,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:26,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:44:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197570390] [2025-03-04 10:44:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197570390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:26,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:26,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:44:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939257338] [2025-03-04 10:44:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:26,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:44:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:26,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:44:26,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:44:26,204 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:26,228 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2025-03-04 10:44:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:44:26,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-04 10:44:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:26,229 INFO L225 Difference]: With dead ends: 67 [2025-03-04 10:44:26,229 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 10:44:26,229 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 10:44:26,230 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:26,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 10:44:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-03-04 10:44:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:44:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-03-04 10:44:26,239 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 25 [2025-03-04 10:44:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:26,239 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-03-04 10:44:26,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:44:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-03-04 10:44:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 10:44:26,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:26,241 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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 10:44:26,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:44:26,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:26,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash 997667102, now seen corresponding path program 1 times [2025-03-04 10:44:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:26,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792804059] [2025-03-04 10:44:26,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:26,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:44:26,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:44:26,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:26,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:44:26,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:26,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792804059] [2025-03-04 10:44:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792804059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:26,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:44:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184338726] [2025-03-04 10:44:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:26,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:44:26,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:26,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:44:26,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:44:26,325 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:26,406 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2025-03-04 10:44:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:44:26,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-04 10:44:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:26,408 INFO L225 Difference]: With dead ends: 64 [2025-03-04 10:44:26,408 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 10:44:26,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:44:26,409 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:26,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 10:44:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-04 10:44:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 46 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 10:44:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2025-03-04 10:44:26,419 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 34 [2025-03-04 10:44:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:26,419 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2025-03-04 10:44:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2025-03-04 10:44:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:44:26,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:26,420 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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 10:44:26,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:44:26,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:26,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 862909063, now seen corresponding path program 1 times [2025-03-04 10:44:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:26,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615739522] [2025-03-04 10:44:26,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:26,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:44:26,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:44:26,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:26,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:44:26,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615739522] [2025-03-04 10:44:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615739522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:26,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:44:26,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41905865] [2025-03-04 10:44:26,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:26,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:44:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:26,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:44:26,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:44:26,519 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:26,594 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2025-03-04 10:44:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:44:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-03-04 10:44:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:26,595 INFO L225 Difference]: With dead ends: 64 [2025-03-04 10:44:26,595 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 10:44:26,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:44:26,596 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:26,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 157 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 10:44:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 10:44:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 41 states have internal predecessors, (43), 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 10:44:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-04 10:44:26,603 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 35 [2025-03-04 10:44:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:26,603 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 10:44:26,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 10:44:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-04 10:44:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:44:26,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:26,604 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1] [2025-03-04 10:44:26,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:44:26,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:26,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:26,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1695335713, now seen corresponding path program 1 times [2025-03-04 10:44:26,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:26,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895193112] [2025-03-04 10:44:26,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:26,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:44:26,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:44:26,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:26,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895193112] [2025-03-04 10:44:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895193112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604517156] [2025-03-04 10:44:26,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:26,692 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 10:44:26,695 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 10:44:26,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:44:26,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:44:26,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:26,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:26,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:44:26,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:26,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604517156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:44:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077040412] [2025-03-04 10:44:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:26,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:44:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:26,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:44:26,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:26,837 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:44:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:26,891 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-04 10:44:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:44:26,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2025-03-04 10:44:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:26,892 INFO L225 Difference]: With dead ends: 53 [2025-03-04 10:44:26,892 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 10:44:26,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:26,893 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:26,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 169 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 10:44:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-04 10:44:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 39 states have internal predecessors, (41), 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 10:44:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-04 10:44:26,899 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 50 [2025-03-04 10:44:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:26,899 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-04 10:44:26,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:44:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-04 10:44:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:44:26,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:26,900 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2025-03-04 10:44:26,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:27,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:27,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1015799531, now seen corresponding path program 1 times [2025-03-04 10:44:27,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:27,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376626619] [2025-03-04 10:44:27,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:27,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:44:27,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:44:27,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:27,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:27,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:27,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376626619] [2025-03-04 10:44:27,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376626619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:27,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670914072] [2025-03-04 10:44:27,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:27,181 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 10:44:27,183 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 10:44:27,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:44:27,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:44:27,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:27,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:27,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:44:27,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:27,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:27,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670914072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:27,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:27,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:44:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681979982] [2025-03-04 10:44:27,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:27,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:44:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:27,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:44:27,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:44:27,375 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:44:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:27,470 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2025-03-04 10:44:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:44:27,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 51 [2025-03-04 10:44:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:27,472 INFO L225 Difference]: With dead ends: 89 [2025-03-04 10:44:27,472 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 10:44:27,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:44:27,473 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:27,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 10:44:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2025-03-04 10:44:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 10:44:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2025-03-04 10:44:27,480 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 51 [2025-03-04 10:44:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:27,481 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-04 10:44:27,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:44:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2025-03-04 10:44:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:44:27,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:27,485 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:27,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:44:27,690 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,SelfDestructingSolverStorable8 [2025-03-04 10:44:27,690 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:27,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 114698370, now seen corresponding path program 1 times [2025-03-04 10:44:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:27,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28328047] [2025-03-04 10:44:27,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:27,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:44:27,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:44:27,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:27,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28328047] [2025-03-04 10:44:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28328047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088832592] [2025-03-04 10:44:27,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:27,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:27,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:27,754 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 10:44:27,756 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 10:44:27,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:44:27,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:44:27,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:27,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:27,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:44:27,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:27,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:27,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088832592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:27,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:27,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:44:27,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802262256] [2025-03-04 10:44:27,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:27,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:44:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:27,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:44:27,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:27,875 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:44:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:27,903 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2025-03-04 10:44:27,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:44:27,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2025-03-04 10:44:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:27,904 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:44:27,904 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 10:44:27,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:27,905 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:27,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 10:44:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 10:44:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 10:44:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2025-03-04 10:44:27,919 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 54 [2025-03-04 10:44:27,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:27,920 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2025-03-04 10:44:27,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:44:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2025-03-04 10:44:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:44:27,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:27,923 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:27,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:28,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:28,128 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:28,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:28,129 INFO L85 PathProgramCache]: Analyzing trace with hash -739317837, now seen corresponding path program 1 times [2025-03-04 10:44:28,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:28,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772230832] [2025-03-04 10:44:28,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:28,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:28,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:44:28,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:44:28,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:28,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772230832] [2025-03-04 10:44:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772230832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376758025] [2025-03-04 10:44:28,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:28,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:28,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:28,203 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 10:44:28,205 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 10:44:28,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:44:28,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:44:28,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:28,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:28,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:44:28,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:28,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:44:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376758025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:28,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:44:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635124681] [2025-03-04 10:44:28,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:28,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:44:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:28,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:44:28,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:44:28,376 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:44:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:28,459 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2025-03-04 10:44:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:44:28,459 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 55 [2025-03-04 10:44:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:28,460 INFO L225 Difference]: With dead ends: 129 [2025-03-04 10:44:28,460 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 10:44:28,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:44:28,461 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 49 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:28,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 234 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 10:44:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2025-03-04 10:44:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.21875) internal successors, (78), 68 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:44:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2025-03-04 10:44:28,479 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 55 [2025-03-04 10:44:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:28,479 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2025-03-04 10:44:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:44:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2025-03-04 10:44:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 10:44:28,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:28,483 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:28,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:44:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:28,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 940454213, now seen corresponding path program 1 times [2025-03-04 10:44:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969836595] [2025-03-04 10:44:28,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:28,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:44:28,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:44:28,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:28,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:44:28,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969836595] [2025-03-04 10:44:28,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969836595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:28,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37377576] [2025-03-04 10:44:28,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:28,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:28,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:28,809 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 10:44:28,811 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 10:44:28,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 10:44:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:44:28,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:28,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:44:28,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:44:28,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:44:28,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37377576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:28,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:44:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-04 10:44:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040307116] [2025-03-04 10:44:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:28,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:44:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:28,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:44:28,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:44:28,916 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:44:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:28,975 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2025-03-04 10:44:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:44:28,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2025-03-04 10:44:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:28,976 INFO L225 Difference]: With dead ends: 94 [2025-03-04 10:44:28,976 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 10:44:28,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:44:28,977 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:28,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 200 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 10:44:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 10:44:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.203125) internal successors, (77), 67 states have internal predecessors, (77), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:44:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2025-03-04 10:44:28,984 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 63 [2025-03-04 10:44:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:28,985 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2025-03-04 10:44:28,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 10:44:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2025-03-04 10:44:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 10:44:28,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:28,985 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:28,992 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 10:44:29,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:44:29,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash -910690496, now seen corresponding path program 1 times [2025-03-04 10:44:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:29,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420670370] [2025-03-04 10:44:29,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:29,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:29,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:44:29,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:44:29,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:29,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:44:29,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420670370] [2025-03-04 10:44:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420670370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959437787] [2025-03-04 10:44:29,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:29,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:29,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:29,297 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 10:44:29,299 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 10:44:29,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 10:44:29,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 10:44:29,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:29,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:29,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:44:29,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:44:29,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:44:29,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959437787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:29,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:29,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:44:29,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994589191] [2025-03-04 10:44:29,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:29,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:44:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:29,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:44:29,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:44:29,524 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 10:44:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:29,646 INFO L93 Difference]: Finished difference Result 109 states and 146 transitions. [2025-03-04 10:44:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:44:29,647 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 64 [2025-03-04 10:44:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:29,648 INFO L225 Difference]: With dead ends: 109 [2025-03-04 10:44:29,648 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 10:44:29,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:44:29,648 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:29,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 252 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 10:44:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 10:44:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 64 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 10:44:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-03-04 10:44:29,660 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 64 [2025-03-04 10:44:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:29,660 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-03-04 10:44:29,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 10:44:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-03-04 10:44:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:44:29,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:29,661 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:29,668 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 10:44:29,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:29,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:29,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1306192181, now seen corresponding path program 1 times [2025-03-04 10:44:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:29,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298677113] [2025-03-04 10:44:29,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:29,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:44:29,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:44:29,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:29,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:44:29,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:29,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298677113] [2025-03-04 10:44:29,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298677113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:29,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096899161] [2025-03-04 10:44:29,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:44:29,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:29,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:29,954 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 10:44:29,956 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 10:44:29,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 10:44:29,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:44:29,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:44:29,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:29,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:44:29,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:44:30,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:44:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096899161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:30,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:44:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524705366] [2025-03-04 10:44:30,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:30,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:44:30,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:30,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:44:30,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:44:30,192 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-04 10:44:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:30,286 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2025-03-04 10:44:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:44:30,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 81 [2025-03-04 10:44:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:30,287 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:44:30,287 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 10:44:30,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:44:30,288 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:30,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 229 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 10:44:30,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2025-03-04 10:44:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 79 states have internal predecessors, (88), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:44:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 148 transitions. [2025-03-04 10:44:30,295 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 148 transitions. Word has length 81 [2025-03-04 10:44:30,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:30,295 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 148 transitions. [2025-03-04 10:44:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.666666666666667) internal successors, (70), 16 states have internal predecessors, (70), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-04 10:44:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2025-03-04 10:44:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 10:44:30,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:30,296 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:30,302 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 10:44:30,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:30,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:30,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2063522421, now seen corresponding path program 2 times [2025-03-04 10:44:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:30,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394065848] [2025-03-04 10:44:30,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:30,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-04 10:44:30,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 10:44:30,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:30,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:44:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394065848] [2025-03-04 10:44:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394065848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515902044] [2025-03-04 10:44:30,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:30,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:30,629 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 10:44:30,631 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 10:44:30,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-04 10:44:30,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 10:44:30,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:30,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:30,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:44:30,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:44:30,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:44:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515902044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:30,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 10:44:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105500129] [2025-03-04 10:44:30,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:44:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:44:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:44:30,944 INFO L87 Difference]: Start difference. First operand 111 states and 148 transitions. Second operand has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-04 10:44:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:31,095 INFO L93 Difference]: Finished difference Result 144 states and 197 transitions. [2025-03-04 10:44:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:44:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 109 [2025-03-04 10:44:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:31,096 INFO L225 Difference]: With dead ends: 144 [2025-03-04 10:44:31,096 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 10:44:31,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:44:31,097 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 13 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:31,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 239 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 10:44:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2025-03-04 10:44:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 88 states have internal predecessors, (100), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 10:44:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 168 transitions. [2025-03-04 10:44:31,105 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 168 transitions. Word has length 109 [2025-03-04 10:44:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:31,105 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 168 transitions. [2025-03-04 10:44:31,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-04 10:44:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 168 transitions. [2025-03-04 10:44:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 10:44:31,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:31,106 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 10:44:31,113 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 10:44:31,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:44:31,307 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:31,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:31,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1998746784, now seen corresponding path program 2 times [2025-03-04 10:44:31,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:31,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974313714] [2025-03-04 10:44:31,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:31,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-04 10:44:31,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:44:31,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:44:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974313714] [2025-03-04 10:44:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974313714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878390458] [2025-03-04 10:44:31,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:31,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:31,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:31,528 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 10:44:31,529 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 10:44:31,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-04 10:44:31,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 10:44:31,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:31,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:31,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:44:31,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:44:31,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 10:44:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878390458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:31,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 10:44:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762762974] [2025-03-04 10:44:31,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:31,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:44:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:31,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:44:31,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:44:31,855 INFO L87 Difference]: Start difference. First operand 124 states and 168 transitions. Second operand has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 10:44:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:32,006 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2025-03-04 10:44:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:44:32,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 122 [2025-03-04 10:44:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:32,008 INFO L225 Difference]: With dead ends: 151 [2025-03-04 10:44:32,008 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 10:44:32,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:44:32,009 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:32,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 287 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 10:44:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2025-03-04 10:44:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 85 states have internal predecessors, (89), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 10:44:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2025-03-04 10:44:32,017 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 122 [2025-03-04 10:44:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2025-03-04 10:44:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.0) internal successors, (92), 24 states have internal predecessors, (92), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-04 10:44:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2025-03-04 10:44:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 10:44:32,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:32,018 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:32,024 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 10:44:32,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:44:32,218 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:32,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash 666723148, now seen corresponding path program 2 times [2025-03-04 10:44:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46989901] [2025-03-04 10:44:32,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:32,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-03-04 10:44:32,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 10:44:32,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:32,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 10:44:32,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46989901] [2025-03-04 10:44:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46989901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844254883] [2025-03-04 10:44:32,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:32,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:32,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:32,441 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 10:44:32,442 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 10:44:32,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-03-04 10:44:32,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 10:44:32,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:32,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:32,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:44:32,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 10:44:32,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 10:44:32,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844254883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:32,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:32,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 10:44:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771319284] [2025-03-04 10:44:32,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:32,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:44:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:32,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:44:32,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:44:32,798 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-04 10:44:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:32,940 INFO L93 Difference]: Finished difference Result 207 states and 273 transitions. [2025-03-04 10:44:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:44:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 142 [2025-03-04 10:44:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:32,942 INFO L225 Difference]: With dead ends: 207 [2025-03-04 10:44:32,942 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 10:44:32,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:44:32,943 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 61 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:32,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 378 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 10:44:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 166. [2025-03-04 10:44:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 115 states have (on average 1.1304347826086956) internal successors, (130), 118 states have internal predecessors, (130), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 10:44:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 222 transitions. [2025-03-04 10:44:32,953 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 222 transitions. Word has length 142 [2025-03-04 10:44:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:32,953 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 222 transitions. [2025-03-04 10:44:32,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.0) internal successors, (115), 24 states have internal predecessors, (115), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-03-04 10:44:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2025-03-04 10:44:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 10:44:32,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:32,955 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:32,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:44:33,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:44:33,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:33,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1313303563, now seen corresponding path program 2 times [2025-03-04 10:44:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751070489] [2025-03-04 10:44:33,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:33,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-03-04 10:44:33,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 10:44:33,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:33,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 10:44:33,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:33,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751070489] [2025-03-04 10:44:33,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751070489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:33,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333558294] [2025-03-04 10:44:33,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:44:33,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:33,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:33,441 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 10:44:33,443 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 10:44:33,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-03-04 10:44:33,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 10:44:33,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:44:33,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:33,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:44:33,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 10:44:33,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 10:44:33,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333558294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:33,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:33,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-04 10:44:33,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031265349] [2025-03-04 10:44:33,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:33,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:44:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:33,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:44:33,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:44:33,968 INFO L87 Difference]: Start difference. First operand 166 states and 222 transitions. Second operand has 32 states, 31 states have (on average 4.580645161290323) internal successors, (142), 32 states have internal predecessors, (142), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-03-04 10:44:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:34,180 INFO L93 Difference]: Finished difference Result 240 states and 337 transitions. [2025-03-04 10:44:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:44:34,180 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.580645161290323) internal successors, (142), 32 states have internal predecessors, (142), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) Word has length 197 [2025-03-04 10:44:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:34,182 INFO L225 Difference]: With dead ends: 240 [2025-03-04 10:44:34,182 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 10:44:34,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:44:34,183 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:34,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 394 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:44:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 10:44:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2025-03-04 10:44:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 148 states have (on average 1.1486486486486487) internal successors, (170), 151 states have internal predecessors, (170), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 10:44:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2025-03-04 10:44:34,196 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 197 [2025-03-04 10:44:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:34,197 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2025-03-04 10:44:34,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.580645161290323) internal successors, (142), 32 states have internal predecessors, (142), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-03-04 10:44:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2025-03-04 10:44:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-04 10:44:34,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:34,198 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:34,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:44:34,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:44:34,401 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:34,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1425742539, now seen corresponding path program 3 times [2025-03-04 10:44:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994304433] [2025-03-04 10:44:34,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:34,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 225 statements into 17 equivalence classes. [2025-03-04 10:44:34,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 225 statements. [2025-03-04 10:44:34,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:44:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2027 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2025-03-04 10:44:34,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994304433] [2025-03-04 10:44:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994304433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:34,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:44:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013681563] [2025-03-04 10:44:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:34,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:44:34,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:34,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:44:34,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:44:34,452 INFO L87 Difference]: Start difference. First operand 215 states and 294 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:44:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:34,536 INFO L93 Difference]: Finished difference Result 215 states and 294 transitions. [2025-03-04 10:44:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:44:34,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 225 [2025-03-04 10:44:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:34,538 INFO L225 Difference]: With dead ends: 215 [2025-03-04 10:44:34,539 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 10:44:34,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:44:34,540 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:34,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 118 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 10:44:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-04 10:44:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 148 states have (on average 1.1418918918918919) internal successors, (169), 150 states have internal predecessors, (169), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 10:44:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 293 transitions. [2025-03-04 10:44:34,574 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 293 transitions. Word has length 225 [2025-03-04 10:44:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 293 transitions. [2025-03-04 10:44:34,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:44:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 293 transitions. [2025-03-04 10:44:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-04 10:44:34,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:34,577 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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 10:44:34,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:44:34,577 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -583989408, now seen corresponding path program 3 times [2025-03-04 10:44:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:34,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845539238] [2025-03-04 10:44:34,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:34,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 238 statements into 17 equivalence classes. [2025-03-04 10:44:34,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 238 statements. [2025-03-04 10:44:34,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:44:34,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-04 10:44:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845539238] [2025-03-04 10:44:34,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845539238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:44:34,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:44:34,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:44:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178258578] [2025-03-04 10:44:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:44:34,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:44:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:34,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:44:34,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:44:34,635 INFO L87 Difference]: Start difference. First operand 214 states and 293 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:44:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:34,723 INFO L93 Difference]: Finished difference Result 214 states and 293 transitions. [2025-03-04 10:44:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:44:34,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 238 [2025-03-04 10:44:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:34,726 INFO L225 Difference]: With dead ends: 214 [2025-03-04 10:44:34,726 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 10:44:34,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:44:34,726 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:34,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:44:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 10:44:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-04 10:44:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 10:44:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 263 transitions. [2025-03-04 10:44:34,748 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 263 transitions. Word has length 238 [2025-03-04 10:44:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:34,749 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 263 transitions. [2025-03-04 10:44:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 10:44:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 263 transitions. [2025-03-04 10:44:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-04 10:44:34,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:34,755 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:34,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:44:34,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:34,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:34,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1589033836, now seen corresponding path program 3 times [2025-03-04 10:44:34,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:34,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715575017] [2025-03-04 10:44:34,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:34,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:34,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 316 statements into 20 equivalence classes. [2025-03-04 10:44:34,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 316 statements. [2025-03-04 10:44:34,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:44:34,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 117 proven. 116 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-04 10:44:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:34,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715575017] [2025-03-04 10:44:34,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715575017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:34,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662136999] [2025-03-04 10:44:34,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:34,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:34,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:34,830 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 10:44:34,832 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 10:44:34,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 316 statements into 20 equivalence classes. [2025-03-04 10:44:34,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 47 of 316 statements. [2025-03-04 10:44:34,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:44:34,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:34,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:44:34,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 117 proven. 116 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-04 10:44:35,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4139 backedges. 117 proven. 116 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-04 10:44:35,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662136999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:35,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:35,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-03-04 10:44:35,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031862681] [2025-03-04 10:44:35,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:35,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:44:35,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:35,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:44:35,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:44:35,399 INFO L87 Difference]: Start difference. First operand 203 states and 263 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:44:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:35,441 INFO L93 Difference]: Finished difference Result 203 states and 263 transitions. [2025-03-04 10:44:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:44:35,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 316 [2025-03-04 10:44:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:35,443 INFO L225 Difference]: With dead ends: 203 [2025-03-04 10:44:35,443 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 10:44:35,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 628 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:44:35,443 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:35,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 10:44:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-04 10:44:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.0070422535211268) internal successors, (143), 142 states have internal predecessors, (143), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 10:44:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 259 transitions. [2025-03-04 10:44:35,454 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 259 transitions. Word has length 316 [2025-03-04 10:44:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:35,455 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 259 transitions. [2025-03-04 10:44:35,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:44:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2025-03-04 10:44:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-04 10:44:35,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:35,458 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:35,464 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 10:44:35,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:44:35,659 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:44:35,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1823361397, now seen corresponding path program 3 times [2025-03-04 10:44:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:35,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525075072] [2025-03-04 10:44:35,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:35,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:35,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 429 statements into 24 equivalence classes. [2025-03-04 10:44:35,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 429 statements. [2025-03-04 10:44:35,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:44:35,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7907 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7694 trivial. 0 not checked. [2025-03-04 10:44:35,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:35,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525075072] [2025-03-04 10:44:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525075072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:35,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529427279] [2025-03-04 10:44:35,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:35,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:35,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:35,720 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 10:44:35,730 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 10:44:35,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 429 statements into 24 equivalence classes. [2025-03-04 10:44:35,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 429 statements. [2025-03-04 10:44:35,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:44:35,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:35,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:44:35,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7907 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7694 trivial. 0 not checked. [2025-03-04 10:44:36,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7907 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7694 trivial. 0 not checked. [2025-03-04 10:44:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529427279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:36,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-04 10:44:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456561494] [2025-03-04 10:44:36,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:36,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:44:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:36,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:44:36,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:44:36,447 INFO L87 Difference]: Start difference. First operand 202 states and 259 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 10:44:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:36,535 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2025-03-04 10:44:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:44:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 429 [2025-03-04 10:44:36,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:36,537 INFO L225 Difference]: With dead ends: 202 [2025-03-04 10:44:36,537 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:44:36,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 849 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:44:36,540 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:36,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 80 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:44:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:44:36,541 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 10:44:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:44:36,541 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 429 [2025-03-04 10:44:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:36,542 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:44:36,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 10:44:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:44:36,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:44:36,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-04 10:44:36,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-04 10:44:36,553 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 10:44:36,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:44:36,755 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:36,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:44:38,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:44:38,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:44:38 BoogieIcfgContainer [2025-03-04 10:44:38,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:44:38,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:44:38,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:44:38,285 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:44:38,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:44:25" (3/4) ... [2025-03-04 10:44:38,287 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:44:38,292 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:44:38,297 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 10:44:38,297 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:44:38,297 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:44:38,297 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:44:38,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:44:38,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:44:38,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:44:38,367 INFO L158 Benchmark]: Toolchain (without parser) took 13595.23ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 113.5MB in the beginning and 178.7MB in the end (delta: -65.3MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:38,367 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:38,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.51ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:38,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.57ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:38,367 INFO L158 Benchmark]: Boogie Preprocessor took 34.02ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.2MB in the end (delta: 848.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:38,367 INFO L158 Benchmark]: IcfgBuilder took 312.60ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 87.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:44:38,368 INFO L158 Benchmark]: TraceAbstraction took 12944.81ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 86.9MB in the beginning and 186.9MB in the end (delta: -100.0MB). Peak memory consumption was 134.6MB. Max. memory is 16.1GB. [2025-03-04 10:44:38,368 INFO L158 Benchmark]: Witness Printer took 81.57ms. Allocated memory is still 276.8MB. Free memory was 184.0MB in the beginning and 178.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:38,369 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.51ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.57ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.02ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.2MB in the end (delta: 848.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 312.60ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 87.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12944.81ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 86.9MB in the beginning and 186.9MB in the end (delta: -100.0MB). Peak memory consumption was 134.6MB. Max. memory is 16.1GB. * Witness Printer took 81.57ms. Allocated memory is still 276.8MB. Free memory was 184.0MB in the beginning and 178.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. 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: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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, 51 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 22, TraceHistogramMax: 58, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 4049 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3195 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1737 IncrementalHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 854 mSDtfsCounter, 1737 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3420 GetRequests, 3203 SyntacticMatches, 4 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=18, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 156 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 4079 NumberOfCodeBlocks, 2342 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5600 ConstructedInterpolants, 0 QuantifiedInterpolants, 10748 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2143 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 50004/51989 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((((((((inlen <= 2147483647) && (2 <= bufferlen)) && (in <= 2147483646)) && (1 <= in)) && (bufferlen <= 2147483646)) && (buf <= 2147483646)) && (1 <= buf)) || (((((inlen <= 2147483647) && (2 <= bufferlen)) && (buf == 0)) && (bufferlen <= 2147483646)) && (in == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:44:38,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE