./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.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/MADWiFi-encode_ie_ok.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 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:43:48,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:43:48,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:43:48,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:43:48,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:43:48,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:43:48,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:43:48,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:43:48,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:43:48,366 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:43:48,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:43:48,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:43:48,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:43:48,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:43:48,366 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:43:48,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:43:48,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:43:48,368 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:43:48,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:43:48,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:43:48,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:43:48,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:43:48,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:43:48,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:43:48,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:43:48,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:43:48,370 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 -> 0816346248b67d4ea9c17aaea510056f7cd51786d8081f1e3a68c606118ae1c9 [2025-03-04 10:43:48,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:43:48,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:43:48,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:43:48,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:43:48,580 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:43:48,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2025-03-04 10:43:49,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785ecda27/053d7daa23744f6e87b3df74a28bf697/FLAG7c1ae6f97 [2025-03-04 10:43:49,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:43:49,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/MADWiFi-encode_ie_ok.i [2025-03-04 10:43:49,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785ecda27/053d7daa23744f6e87b3df74a28bf697/FLAG7c1ae6f97 [2025-03-04 10:43:50,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/785ecda27/053d7daa23744f6e87b3df74a28bf697 [2025-03-04 10:43:50,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:43:50,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:43:50,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:50,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:43:50,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:43:50,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50, skipping insertion in model container [2025-03-04 10:43:50,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:43:50,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:50,429 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:43:50,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:50,456 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:43:50,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50 WrapperNode [2025-03-04 10:43:50,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:50,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:50,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:43:50,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:43:50,463 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:43:50" (1/1) ... [2025-03-04 10:43:50,468 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:43:50" (1/1) ... [2025-03-04 10:43:50,478 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-04 10:43:50,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:50,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:43:50,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:43:50,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:43:50,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,500 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:43:50,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:43:50,511 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:43:50,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:43:50,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:43:50,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (1/1) ... [2025-03-04 10:43:50,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:43:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:50,541 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:43:50,545 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:43:50,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:43:50,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:43:50,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:43:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:43:50,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:43:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:43:50,611 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:43:50,613 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:43:50,743 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-04 10:43:50,743 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:43:50,750 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:43:50,750 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:43:50,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:50 BoogieIcfgContainer [2025-03-04 10:43:50,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:43:50,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:43:50,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:43:50,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:43:50,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:43:50" (1/3) ... [2025-03-04 10:43:50,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eea4b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:50, skipping insertion in model container [2025-03-04 10:43:50,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:50" (2/3) ... [2025-03-04 10:43:50,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eea4b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:50, skipping insertion in model container [2025-03-04 10:43:50,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:50" (3/3) ... [2025-03-04 10:43:50,758 INFO L128 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.i [2025-03-04 10:43:50,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:43:50,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG MADWiFi-encode_ie_ok.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 12 error locations. [2025-03-04 10:43:50,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:43:50,819 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;@1a3e27b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:43:50,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 10:43:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 43 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 10:43:50,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:50,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:50,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:50,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -174076079, now seen corresponding path program 1 times [2025-03-04 10:43:50,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:50,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304669847] [2025-03-04 10:43:50,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:50,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:43:50,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:43:50,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:50,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,000 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:43:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304669847] [2025-03-04 10:43:51,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304669847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507949788] [2025-03-04 10:43:51,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:51,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:51,020 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 43 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,087 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2025-03-04 10:43:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 10:43:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,093 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:43:51,093 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 10:43:51,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:51,097 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 10:43:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 10:43:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-03-04 10:43:51,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 10 [2025-03-04 10:43:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,123 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-03-04 10:43:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-03-04 10:43:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:43:51,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:43:51,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1101391153, now seen corresponding path program 1 times [2025-03-04 10:43:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59357016] [2025-03-04 10:43:51,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:43:51,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:43:51,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59357016] [2025-03-04 10:43:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59357016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400872605] [2025-03-04 10:43:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:51,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:51,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:51,184 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,213 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2025-03-04 10:43:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:43:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,215 INFO L225 Difference]: With dead ends: 40 [2025-03-04 10:43:51,215 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 10:43:51,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:51,216 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 10:43:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 10:43:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 35 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2025-03-04 10:43:51,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2025-03-04 10:43:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,221 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2025-03-04 10:43:51,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2025-03-04 10:43:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:43:51,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:43:51,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 216612623, now seen corresponding path program 1 times [2025-03-04 10:43:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334879403] [2025-03-04 10:43:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:43:51,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:43:51,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,297 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:43:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334879403] [2025-03-04 10:43:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334879403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:51,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12467497] [2025-03-04 10:43:51,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:51,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:51,300 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,315 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2025-03-04 10:43:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:43:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,316 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:43:51,316 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:43:51,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:51,317 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 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:43:51,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:43:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:43:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-03-04 10:43:51,322 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 12 [2025-03-04 10:43:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,322 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-03-04 10:43:51,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-03-04 10:43:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:43:51,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:43:51,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1874943283, now seen corresponding path program 1 times [2025-03-04 10:43:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119861663] [2025-03-04 10:43:51,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:43:51,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:43:51,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,398 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:43:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119861663] [2025-03-04 10:43:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119861663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979335156] [2025-03-04 10:43:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:51,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:51,401 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:43:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,412 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-03-04 10:43:51,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:51,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-03-04 10:43:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,413 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:43:51,413 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 10:43:51,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:51,414 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 10:43:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 10:43:51,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 33 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-03-04 10:43:51,418 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 13 [2025-03-04 10:43:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,418 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-03-04 10:43:51,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:43:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-03-04 10:43:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:43:51,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:43:51,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2006300365, now seen corresponding path program 1 times [2025-03-04 10:43:51,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759102513] [2025-03-04 10:43:51,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:43:51,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:43:51,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,445 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:43:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759102513] [2025-03-04 10:43:51,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759102513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033907509] [2025-03-04 10:43:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:51,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:51,446 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:43:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,462 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-04 10:43:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:51,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 10:43:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,475 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:43:51,478 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:43:51,479 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:43:51,479 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:43:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:43:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-03-04 10:43:51,482 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 14 [2025-03-04 10:43:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,484 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-03-04 10:43:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:43:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-03-04 10:43:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:43:51,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:43:51,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2065769163, now seen corresponding path program 1 times [2025-03-04 10:43:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293440468] [2025-03-04 10:43:51,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:43:51,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:43:51,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,516 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:43:51,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293440468] [2025-03-04 10:43:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293440468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:43:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694244960] [2025-03-04 10:43:51,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:51,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:43:51,517 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,527 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-03-04 10:43:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:43:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,529 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:43:51,529 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:43:51,529 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:43:51,529 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 39 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:43:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 10:43:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-04 10:43:51,532 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 15 [2025-03-04 10:43:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-04 10:43:51,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:43:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-04 10:43:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:43:51,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:43:51,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -116868376, now seen corresponding path program 1 times [2025-03-04 10:43:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559402167] [2025-03-04 10:43:51,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:43:51,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:43:51,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,611 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:43:51,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559402167] [2025-03-04 10:43:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559402167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:43:51,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106171347] [2025-03-04 10:43:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:43:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:43:51,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:51,614 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,641 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-03-04 10:43:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:43:51,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 10:43:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,642 INFO L225 Difference]: With dead ends: 35 [2025-03-04 10:43:51,642 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:43:51,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:51,643 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:43:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 10:43:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-04 10:43:51,645 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2025-03-04 10:43:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,646 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-04 10:43:51,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-04 10:43:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:43:51,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:43:51,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 672047620, now seen corresponding path program 1 times [2025-03-04 10:43:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216005362] [2025-03-04 10:43:51,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:43:51,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:43:51,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,708 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:43:51,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216005362] [2025-03-04 10:43:51,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216005362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:43:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050137332] [2025-03-04 10:43:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:43:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:43:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:51,710 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,737 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-03-04 10:43:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:43:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-04 10:43:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,738 INFO L225 Difference]: With dead ends: 42 [2025-03-04 10:43:51,738 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 10:43:51,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:43:51,739 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 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:43:51,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 10:43:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 10:43:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:43:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-04 10:43:51,743 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2025-03-04 10:43:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,744 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-04 10:43:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-04 10:43:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:43:51,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,744 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:43:51,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -218120028, now seen corresponding path program 1 times [2025-03-04 10:43:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147217737] [2025-03-04 10:43:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:43:51,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:43:51,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,796 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:43:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147217737] [2025-03-04 10:43:51,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147217737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:51,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022593782] [2025-03-04 10:43:51,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:51,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:51,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:51,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:51,798 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:43:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,818 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2025-03-04 10:43:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 32 [2025-03-04 10:43:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,821 INFO L225 Difference]: With dead ends: 44 [2025-03-04 10:43:51,821 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 10:43:51,821 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:43:51,822 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 10:43:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 10:43:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:43:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-03-04 10:43:51,829 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2025-03-04 10:43:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,830 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-03-04 10:43:51,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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:43:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-03-04 10:43:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:43:51,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,831 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:43:51,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 825809975, now seen corresponding path program 1 times [2025-03-04 10:43:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676337908] [2025-03-04 10:43:51,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:43:51,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:43:51,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:43:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676337908] [2025-03-04 10:43:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676337908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:51,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279228475] [2025-03-04 10:43:51,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:51,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:51,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:51,934 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:43:51,936 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:43:51,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:43:51,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:43:51,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:51,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:51,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:43:51,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:43:52,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:52,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:43:52,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279228475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:52,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:52,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-04 10:43:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028151970] [2025-03-04 10:43:52,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:52,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:43:52,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:52,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:43:52,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:43:52,194 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:43:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:52,365 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-04 10:43:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:43:52,365 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-04 10:43:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:52,366 INFO L225 Difference]: With dead ends: 70 [2025-03-04 10:43:52,366 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 10:43:52,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:43:52,367 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:52,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 131 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 10:43:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-04 10:43:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.16) internal successors, (58), 53 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:43:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2025-03-04 10:43:52,373 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 41 [2025-03-04 10:43:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:52,373 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2025-03-04 10:43:52,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 10:43:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2025-03-04 10:43:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:43:52,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:52,374 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:52,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:43:52,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:43:52,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:52,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1022498775, now seen corresponding path program 1 times [2025-03-04 10:43:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:52,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939065459] [2025-03-04 10:43:52,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:52,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:43:52,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:43:52,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:52,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:52,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:52,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939065459] [2025-03-04 10:43:52,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939065459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:52,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531031828] [2025-03-04 10:43:52,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:52,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:52,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:52,654 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:43:52,655 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:43:52,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:43:52,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:43:52,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:52,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:52,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:43:52,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:52,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:43:52,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531031828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:52,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:43:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:43:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146414972] [2025-03-04 10:43:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:43:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:52,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:43:52,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:43:52,724 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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:43:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:52,743 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-04 10:43:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:43:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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 49 [2025-03-04 10:43:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:52,744 INFO L225 Difference]: With dead ends: 64 [2025-03-04 10:43:52,744 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 10:43:52,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 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:43:52,744 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:52,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 10:43:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 10:43:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.1) internal successors, (55), 52 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:43:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-03-04 10:43:52,752 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 49 [2025-03-04 10:43:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:52,752 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-03-04 10:43:52,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 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:43:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-03-04 10:43:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:43:52,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:52,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:52,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:52,954 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,SelfDestructingSolverStorable10 [2025-03-04 10:43:52,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:52,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1632690924, now seen corresponding path program 1 times [2025-03-04 10:43:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:52,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280246927] [2025-03-04 10:43:52,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:52,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:43:52,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:43:52,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:52,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280246927] [2025-03-04 10:43:53,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280246927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563336240] [2025-03-04 10:43:53,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:53,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:53,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:53,029 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:43:53,030 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:43:53,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 10:43:53,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:43:53,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:53,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:43:53,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:53,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563336240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:53,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:53,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:43:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659739124] [2025-03-04 10:43:53,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:53,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:43:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:53,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:43:53,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:43:53,173 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:43:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:53,218 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-04 10:43:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:43:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 50 [2025-03-04 10:43:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:53,219 INFO L225 Difference]: With dead ends: 70 [2025-03-04 10:43:53,219 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 10:43:53,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 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:43:53,220 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:53,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 10:43:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-04 10:43:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 56 states have internal predecessors, (58), 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:43:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-04 10:43:53,230 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 50 [2025-03-04 10:43:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:53,230 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-04 10:43:53,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:43:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-04 10:43:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 10:43:53,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:53,233 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:53,240 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:43:53,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:53,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:53,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1797894610, now seen corresponding path program 1 times [2025-03-04 10:43:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353379495] [2025-03-04 10:43:53,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:53,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:43:53,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:43:53,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:53,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:43:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353379495] [2025-03-04 10:43:53,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353379495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:53,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684732339] [2025-03-04 10:43:53,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:53,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:53,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:53,580 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:43:53,583 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:43:53,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 10:43:53,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 10:43:53,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:53,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:53,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:43:53,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:43:53,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:43:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684732339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:54,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2025-03-04 10:43:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609375324] [2025-03-04 10:43:54,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:54,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:43:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:54,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:43:54,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:43:54,114 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 30 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 12 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 10:43:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:54,581 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2025-03-04 10:43:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:43:54,581 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 12 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 82 [2025-03-04 10:43:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:54,582 INFO L225 Difference]: With dead ends: 106 [2025-03-04 10:43:54,582 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 10:43:54,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=491, Invalid=1401, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:43:54,583 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:54,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 207 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:43:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 10:43:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-04 10:43:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.075) internal successors, (86), 82 states have internal predecessors, (86), 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:43:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2025-03-04 10:43:54,590 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 82 [2025-03-04 10:43:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:54,591 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2025-03-04 10:43:54,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 12 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 10:43:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2025-03-04 10:43:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 10:43:54,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:54,592 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:54,598 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:43:54,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:54,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:54,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1651616511, now seen corresponding path program 2 times [2025-03-04 10:43:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:54,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142682627] [2025-03-04 10:43:54,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:54,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-03-04 10:43:54,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 101 statements. [2025-03-04 10:43:54,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:43:54,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-04 10:43:54,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142682627] [2025-03-04 10:43:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142682627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614195046] [2025-03-04 10:43:54,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:54,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:54,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:54,848 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:43:54,849 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:43:54,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-03-04 10:43:54,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 101 statements. [2025-03-04 10:43:54,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:43:54,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:54,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:43:54,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-04 10:43:54,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-04 10:43:55,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614195046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:55,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:55,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2025-03-04 10:43:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557357061] [2025-03-04 10:43:55,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:55,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:43:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:55,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:43:55,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:43:55,047 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 14 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 10:43:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:55,149 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2025-03-04 10:43:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:43:55,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 101 [2025-03-04 10:43:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:55,151 INFO L225 Difference]: With dead ends: 102 [2025-03-04 10:43:55,151 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:43:55,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:43:55,151 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:55,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 127 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:43:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 10:43:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.025) internal successors, (82), 81 states have internal predecessors, (82), 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:43:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2025-03-04 10:43:55,158 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 101 [2025-03-04 10:43:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:55,159 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2025-03-04 10:43:55,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.615384615384615) internal successors, (86), 14 states have internal predecessors, (86), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 10:43:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2025-03-04 10:43:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 10:43:55,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:55,160 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:55,180 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:43:55,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:43:55,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:55,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 613499780, now seen corresponding path program 2 times [2025-03-04 10:43:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:55,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833181855] [2025-03-04 10:43:55,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:55,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 10:43:55,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:43:55,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:55,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:43:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:55,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833181855] [2025-03-04 10:43:55,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833181855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:55,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688785384] [2025-03-04 10:43:55,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:55,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:55,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:55,657 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:43:55,658 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:43:55,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-04 10:43:55,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 10:43:55,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:55,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:55,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 10:43:55,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:43:56,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 10:43:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688785384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:57,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:57,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 22] total 54 [2025-03-04 10:43:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660343374] [2025-03-04 10:43:57,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:57,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 10:43:57,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:57,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 10:43:57,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=2522, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 10:43:57,080 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 55 states, 54 states have (on average 3.9814814814814814) internal successors, (215), 55 states have internal predecessors, (215), 27 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 27 states have call predecessors, (51), 27 states have call successors, (51) [2025-03-04 10:43:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:58,804 INFO L93 Difference]: Finished difference Result 190 states and 243 transitions. [2025-03-04 10:43:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 10:43:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.9814814814814814) internal successors, (215), 55 states have internal predecessors, (215), 27 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 27 states have call predecessors, (51), 27 states have call successors, (51) Word has length 160 [2025-03-04 10:43:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:58,806 INFO L225 Difference]: With dead ends: 190 [2025-03-04 10:43:58,806 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 10:43:58,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2535 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2124, Invalid=7776, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 10:43:58,810 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 79 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:58,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 673 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:43:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 10:43:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-04 10:43:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 149 states have internal predecessors, (150), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 10:43:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2025-03-04 10:43:58,823 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 160 [2025-03-04 10:43:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:58,825 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2025-03-04 10:43:58,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.9814814814814814) internal successors, (215), 55 states have internal predecessors, (215), 27 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 27 states have call predecessors, (51), 27 states have call successors, (51) [2025-03-04 10:43:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2025-03-04 10:43:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 10:43:58,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:58,831 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:58,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:59,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:43:59,034 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:43:59,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:59,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1047323854, now seen corresponding path program 2 times [2025-03-04 10:43:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:59,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565048529] [2025-03-04 10:43:59,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:59,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 320 statements into 2 equivalence classes. [2025-03-04 10:43:59,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 10:43:59,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:59,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:59,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3863 backedges. 0 proven. 1343 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-04 10:43:59,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:59,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565048529] [2025-03-04 10:43:59,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565048529] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:59,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27115613] [2025-03-04 10:43:59,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:59,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:59,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:59,739 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:43:59,740 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:43:59,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 320 statements into 2 equivalence classes. [2025-03-04 10:43:59,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 10:43:59,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:59,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:59,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 10:43:59,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3863 backedges. 0 proven. 1343 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-04 10:44:00,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3863 backedges. 0 proven. 1343 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-04 10:44:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27115613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:02,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 40, 40] total 99 [2025-03-04 10:44:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643587804] [2025-03-04 10:44:02,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:02,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-03-04 10:44:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:02,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-03-04 10:44:02,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=8651, Unknown=0, NotChecked=0, Total=9900 [2025-03-04 10:44:02,960 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 100 states, 99 states have (on average 4.141414141414141) internal successors, (410), 100 states have internal predecessors, (410), 54 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 54 states have call predecessors, (108), 54 states have call successors, (108) [2025-03-04 10:44:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:09,713 INFO L93 Difference]: Finished difference Result 355 states and 463 transitions. [2025-03-04 10:44:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-03-04 10:44:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 4.141414141414141) internal successors, (410), 100 states have internal predecessors, (410), 54 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 54 states have call predecessors, (108), 54 states have call successors, (108) Word has length 320 [2025-03-04 10:44:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:09,715 INFO L225 Difference]: With dead ends: 355 [2025-03-04 10:44:09,715 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 10:44:09,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 562 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10329 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7911, Invalid=31491, Unknown=0, NotChecked=0, Total=39402 [2025-03-04 10:44:09,722 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 48 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 6716 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 6784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 6716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:09,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1659 Invalid, 6784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 6716 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 10:44:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 10:44:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-04 10:44:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 276 states have (on average 1.0072463768115942) internal successors, (278), 277 states have internal predecessors, (278), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 10:44:09,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 426 transitions. [2025-03-04 10:44:09,745 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 426 transitions. Word has length 320 [2025-03-04 10:44:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 426 transitions. [2025-03-04 10:44:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 4.141414141414141) internal successors, (410), 100 states have internal predecessors, (410), 54 states have call successors, (108), 1 states have call predecessors, (108), 1 states have return successors, (108), 54 states have call predecessors, (108), 54 states have call successors, (108) [2025-03-04 10:44:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 426 transitions. [2025-03-04 10:44:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2025-03-04 10:44:09,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:44:09,755 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:09,762 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:09,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:09,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-04 10:44:09,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:44:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2111350980, now seen corresponding path program 3 times [2025-03-04 10:44:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:44:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022584027] [2025-03-04 10:44:09,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:44:09,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 636 statements into 50 equivalence classes. [2025-03-04 10:44:09,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 51 of 636 statements. [2025-03-04 10:44:09,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:44:09,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16326 backedges. 213 proven. 287 refuted. 0 times theorem prover too weak. 15826 trivial. 0 not checked. [2025-03-04 10:44:10,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:44:10,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022584027] [2025-03-04 10:44:10,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022584027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:44:10,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506113428] [2025-03-04 10:44:10,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:44:10,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:44:10,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:44:10,039 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:10,041 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:10,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 636 statements into 50 equivalence classes. [2025-03-04 10:44:10,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 51 of 636 statements. [2025-03-04 10:44:10,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:44:10,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:44:10,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:44:10,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:44:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16326 backedges. 213 proven. 287 refuted. 0 times theorem prover too weak. 15826 trivial. 0 not checked. [2025-03-04 10:44:10,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:44:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16326 backedges. 213 proven. 287 refuted. 0 times theorem prover too weak. 15826 trivial. 0 not checked. [2025-03-04 10:44:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506113428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:44:10,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:44:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:44:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718213597] [2025-03-04 10:44:10,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:44:10,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:44:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:44:10,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:44:10,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:44:10,867 INFO L87 Difference]: Start difference. First operand 353 states and 426 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:44:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:44:10,949 INFO L93 Difference]: Finished difference Result 353 states and 426 transitions. [2025-03-04 10:44:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:44:10,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 636 [2025-03-04 10:44:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:44:10,953 INFO L225 Difference]: With dead ends: 353 [2025-03-04 10:44:10,953 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:44:10,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1281 GetRequests, 1265 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:44:10,955 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:44:10,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 112 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:44:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:44:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:44:10,957 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:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:44:10,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 636 [2025-03-04 10:44:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:44:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:44:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:44:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:44:10,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 10:44:10,960 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 10:44:10,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:44:11,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:44:11,163 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:44:11,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:44:11,743 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:44:11,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:44:11 BoogieIcfgContainer [2025-03-04 10:44:11,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:44:11,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:44:11,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:44:11,752 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:44:11,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:50" (3/4) ... [2025-03-04 10:44:11,754 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:44:11,758 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:44:11,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 10:44:11,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:44:11,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:44:11,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:44:11,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:44:11,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:44:11,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:44:11,819 INFO L158 Benchmark]: Toolchain (without parser) took 21527.02ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 104.8MB in the beginning and 239.9MB in the end (delta: -135.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2025-03-04 10:44:11,820 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:11,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.12ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 93.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:11,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.05ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.7MB in the end (delta: 939.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:44:11,820 INFO L158 Benchmark]: Boogie Preprocessor took 31.33ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:11,821 INFO L158 Benchmark]: IcfgBuilder took 239.57ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 78.1MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:11,821 INFO L158 Benchmark]: TraceAbstraction took 20999.79ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 78.1MB in the beginning and 244.7MB in the end (delta: -166.6MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. [2025-03-04 10:44:11,821 INFO L158 Benchmark]: Witness Printer took 66.26ms. Allocated memory is still 293.6MB. Free memory was 244.7MB in the beginning and 239.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:44:11,823 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.12ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 93.6MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.05ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.7MB in the end (delta: 939.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.33ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.6MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 239.57ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 78.1MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20999.79ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 78.1MB in the beginning and 244.7MB in the end (delta: -166.6MB). Peak memory consumption was 151.3MB. Max. memory is 16.1GB. * Witness Printer took 66.26ms. Allocated memory is still 293.6MB. Free memory was 244.7MB in the beginning and 239.9MB in the end (delta: 4.8MB). 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: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: 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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 17, TraceHistogramMax: 73, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 3740 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3178 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9701 IncrementalHoareTripleChecker+Invalid, 9887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 562 mSDtfsCounter, 9701 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3096 GetRequests, 2663 SyntacticMatches, 5 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13521 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=16, InterpolantAutomatonStates: 264, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3032 NumberOfCodeBlocks, 1712 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4390 ConstructedInterpolants, 0 QuantifiedInterpolants, 13189 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1586 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 58527/64556 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 12 specifications checked. All of them hold - InvariantResult [Line: 49]: Location Invariant Derived location invariant: (((((((1 <= p) && (i == 0)) && (((long long) p + bufsize) <= 999999)) && (bufsize_0 <= 999999)) && ((p + ((long long) 2 * ielen)) <= 999999)) && (1 <= ielen)) || ((((((((i <= 999998) && (1 <= p)) && (1 <= i)) && (ielen <= 499999)) && (bufsize_0 <= 999999)) && (p <= 999999)) && (bufsize <= 999998)) && (1 <= ielen))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:44:11,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE