./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de7b6b08db65388ab09a4594226fbc2a49bc8d65ecd2b95d922fabd4f3caf1d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:54:32,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:54:32,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:54:32,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:54:32,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:54:32,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:54:32,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:54:32,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:54:32,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:54:32,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:54:32,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:54:32,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:54:32,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:54:32,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:54:32,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:54:32,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:54:32,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:54:32,817 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de7b6b08db65388ab09a4594226fbc2a49bc8d65ecd2b95d922fabd4f3caf1d7 [2025-03-09 01:54:33,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:54:33,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:54:33,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:54:33,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:54:33,056 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:54:33,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg-alloca-1.i [2025-03-09 01:54:34,225 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a56f5d14/2cd6fdfa9d674d7c97195b55230a0da7/FLAG5b8604e6a [2025-03-09 01:54:34,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:54:34,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg-alloca-1.i [2025-03-09 01:54:34,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a56f5d14/2cd6fdfa9d674d7c97195b55230a0da7/FLAG5b8604e6a [2025-03-09 01:54:34,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a56f5d14/2cd6fdfa9d674d7c97195b55230a0da7 [2025-03-09 01:54:34,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:54:34,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:54:34,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:54:34,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:54:34,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:54:34,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:54:34" (1/1) ... [2025-03-09 01:54:34,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d9cf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:34, skipping insertion in model container [2025-03-09 01:54:34,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:54:34" (1/1) ... [2025-03-09 01:54:34,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:54:35,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:54:35,037 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:54:35,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:54:35,087 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:54:35,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35 WrapperNode [2025-03-09 01:54:35,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:54:35,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:54:35,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:54:35,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:54:35,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,117 INFO L138 Inliner]: procedures = 115, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 21 [2025-03-09 01:54:35,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:54:35,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:54:35,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:54:35,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:54:35,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,139 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2025-03-09 01:54:35,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:54:35,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:54:35,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:54:35,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:54:35,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (1/1) ... [2025-03-09 01:54:35,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:54:35,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:54:35,180 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-09 01:54:35,183 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-09 01:54:35,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:54:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:54:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:54:35,201 INFO L130 BoogieDeclarations]: Found specification of procedure new_lseg [2025-03-09 01:54:35,202 INFO L138 BoogieDeclarations]: Found implementation of procedure new_lseg [2025-03-09 01:54:35,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:54:35,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:54:35,266 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:54:35,267 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:54:35,365 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-09 01:54:35,365 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:54:35,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:54:35,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:54:35,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:54:35 BoogieIcfgContainer [2025-03-09 01:54:35,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:54:35,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:54:35,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:54:35,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:54:35,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:54:34" (1/3) ... [2025-03-09 01:54:35,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1720d84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:54:35, skipping insertion in model container [2025-03-09 01:54:35,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:54:35" (2/3) ... [2025-03-09 01:54:35,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1720d84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:54:35, skipping insertion in model container [2025-03-09 01:54:35,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:54:35" (3/3) ... [2025-03-09 01:54:35,381 INFO L128 eAbstractionObserver]: Analyzing ICFG cll_by_lseg-alloca-1.i [2025-03-09 01:54:35,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:54:35,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cll_by_lseg-alloca-1.i that has 2 procedures, 22 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 01:54:35,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:54:35,436 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;@4eb3a427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:54:35,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:54:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 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-09 01:54:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-09 01:54:35,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:35,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-09 01:54:35,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:35,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash 40681, now seen corresponding path program 1 times [2025-03-09 01:54:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:35,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361110574] [2025-03-09 01:54:35,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:54:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:35,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:54:35,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:54:35,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:54:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:35,606 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-09 01:54:35,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:35,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361110574] [2025-03-09 01:54:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361110574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:54:35,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:54:35,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:54:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012120919] [2025-03-09 01:54:35,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:54:35,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:54:35,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:35,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:54:35,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:54:35,629 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:35,646 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-03-09 01:54:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:54:35,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-09 01:54:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:35,651 INFO L225 Difference]: With dead ends: 22 [2025-03-09 01:54:35,651 INFO L226 Difference]: Without dead ends: 12 [2025-03-09 01:54:35,655 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-09 01:54:35,656 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:54:35,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:54:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-09 01:54:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-09 01:54:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-09 01:54:35,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 3 [2025-03-09 01:54:35,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:35,680 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-09 01:54:35,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-09 01:54:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:54:35,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:35,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:54:35,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:54:35,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting new_lsegErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:35,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash 704034168, now seen corresponding path program 1 times [2025-03-09 01:54:35,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:35,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972940478] [2025-03-09 01:54:35,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:54:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:54:35,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:54:35,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:54:35,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:35,802 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-09 01:54:35,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:35,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972940478] [2025-03-09 01:54:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972940478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:54:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:54:35,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:54:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626088983] [2025-03-09 01:54:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:54:35,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:54:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:35,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:54:35,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:54:35,804 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:35,849 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-09 01:54:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:54:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:54:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:35,850 INFO L225 Difference]: With dead ends: 19 [2025-03-09 01:54:35,850 INFO L226 Difference]: Without dead ends: 18 [2025-03-09 01:54:35,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:54:35,853 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:54:35,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 18 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:54:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-09 01:54:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-09 01:54:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-09 01:54:35,856 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-09 01:54:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:35,856 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-09 01:54:35,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-09 01:54:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:54:35,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:35,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:54:35,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:54:35,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:35,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash 350222713, now seen corresponding path program 1 times [2025-03-09 01:54:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:35,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548752031] [2025-03-09 01:54:35,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:54:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:35,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:54:35,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:54:35,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:54:35,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:35,969 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-09 01:54:35,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548752031] [2025-03-09 01:54:35,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548752031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:54:35,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:54:35,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:54:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660967742] [2025-03-09 01:54:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:54:35,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:54:35,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:35,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:54:35,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:54:35,971 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:36,006 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-09 01:54:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:54:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:54:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:36,006 INFO L225 Difference]: With dead ends: 15 [2025-03-09 01:54:36,006 INFO L226 Difference]: Without dead ends: 14 [2025-03-09 01:54:36,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:54:36,007 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 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-09 01:54:36,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:54:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-09 01:54:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 01:54:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-09 01:54:36,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 9 [2025-03-09 01:54:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:36,009 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-09 01:54:36,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-09 01:54:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:54:36,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:36,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:54:36,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:54:36,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting new_lsegErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1222843536, now seen corresponding path program 1 times [2025-03-09 01:54:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:36,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654631396] [2025-03-09 01:54:36,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:54:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:36,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:54:36,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:54:36,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:54:36,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:36,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654631396] [2025-03-09 01:54:36,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654631396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:54:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832525661] [2025-03-09 01:54:36,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:54:36,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:36,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:54:36,156 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-09 01:54:36,158 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-09 01:54:36,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:54:36,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:54:36,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:54:36,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:36,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:54:36,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:54:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:36,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:54:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:36,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832525661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:54:36,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:54:36,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:54:36,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102801993] [2025-03-09 01:54:36,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:54:36,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:54:36,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:36,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:54:36,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:54:36,361 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:36,445 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-09 01:54:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:54:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:54:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:36,446 INFO L225 Difference]: With dead ends: 32 [2025-03-09 01:54:36,446 INFO L226 Difference]: Without dead ends: 31 [2025-03-09 01:54:36,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:54:36,447 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:54:36,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:54:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-09 01:54:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-03-09 01:54:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-03-09 01:54:36,450 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2025-03-09 01:54:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:36,450 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-03-09 01:54:36,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-03-09 01:54:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:54:36,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:36,451 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 01:54:36,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:54:36,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:36,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting new_lsegErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:36,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1818317688, now seen corresponding path program 2 times [2025-03-09 01:54:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:36,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832315773] [2025-03-09 01:54:36,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:54:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:36,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:54:36,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:54:36,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:54:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:36,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832315773] [2025-03-09 01:54:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832315773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:54:36,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631576697] [2025-03-09 01:54:36,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:54:36,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:36,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:54:36,903 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-09 01:54:36,904 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-09 01:54:36,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-09 01:54:36,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:54:36,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:54:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:36,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:54:36,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:54:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:37,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:54:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631576697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:54:37,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:54:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-09 01:54:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770197246] [2025-03-09 01:54:37,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:54:37,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:54:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:37,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:54:37,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:54:37,201 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (11), 10 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:37,440 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2025-03-09 01:54:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:54:37,441 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (11), 10 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-09 01:54:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:37,441 INFO L225 Difference]: With dead ends: 62 [2025-03-09 01:54:37,441 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 01:54:37,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=875, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:54:37,442 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 133 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:54:37,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 28 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:54:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 01:54:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-03-09 01:54:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2025-03-09 01:54:37,453 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 28 [2025-03-09 01:54:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:37,453 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2025-03-09 01:54:37,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (11), 10 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2025-03-09 01:54:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 01:54:37,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:37,454 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 01:54:37,462 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-09 01:54:37,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:37,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting new_lsegErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:37,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -833445768, now seen corresponding path program 3 times [2025-03-09 01:54:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:37,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488673794] [2025-03-09 01:54:37,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:54:37,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:37,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-03-09 01:54:37,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:54:37,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:54:37,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488673794] [2025-03-09 01:54:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488673794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:54:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537372658] [2025-03-09 01:54:38,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:54:38,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:38,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:54:38,281 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-09 01:54:38,282 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-09 01:54:38,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-03-09 01:54:40,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:54:40,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:54:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:40,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:54:40,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:54:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:40,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:54:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537372658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:54:41,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:54:41,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-03-09 01:54:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328478085] [2025-03-09 01:54:41,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:54:41,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-09 01:54:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:41,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-09 01:54:41,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=1792, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 01:54:41,295 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 49 states, 48 states have (on average 2.0) internal successors, (96), 27 states have internal predecessors, (96), 23 states have call successors, (23), 22 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:41,888 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2025-03-09 01:54:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-09 01:54:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0) internal successors, (96), 27 states have internal predecessors, (96), 23 states have call successors, (23), 22 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-09 01:54:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:41,890 INFO L225 Difference]: With dead ends: 122 [2025-03-09 01:54:41,891 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 01:54:41,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1341, Invalid=3629, Unknown=0, NotChecked=0, Total=4970 [2025-03-09 01:54:41,894 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 325 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:54:41,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 40 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:54:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 01:54:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-09 01:54:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.0105263157894737) internal successors, (96), 95 states have internal predecessors, (96), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2025-03-09 01:54:41,912 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 58 [2025-03-09 01:54:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:41,912 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2025-03-09 01:54:41,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0) internal successors, (96), 27 states have internal predecessors, (96), 23 states have call successors, (23), 22 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2025-03-09 01:54:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 01:54:41,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:41,916 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-03-09 01:54:41,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:54:42,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:42,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting new_lsegErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:42,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1417083512, now seen corresponding path program 4 times [2025-03-09 01:54:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:42,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358055297] [2025-03-09 01:54:42,118 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:54:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:42,169 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-03-09 01:54:42,201 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 01:54:42,201 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:54:42,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:43,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358055297] [2025-03-09 01:54:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358055297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:54:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687798634] [2025-03-09 01:54:43,659 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:54:43,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:43,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:54:43,661 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-09 01:54:43,663 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-09 01:54:43,757 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-03-09 01:54:43,848 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 01:54:43,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:54:43,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:43,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-09 01:54:43,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:54:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:44,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:54:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:45,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687798634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:54:45,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:54:45,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2025-03-09 01:54:45,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444819764] [2025-03-09 01:54:45,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:54:45,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-09 01:54:45,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:54:45,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-09 01:54:45,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2264, Invalid=7048, Unknown=0, NotChecked=0, Total=9312 [2025-03-09 01:54:45,567 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand has 97 states, 96 states have (on average 2.0) internal successors, (192), 51 states have internal predecessors, (192), 47 states have call successors, (47), 46 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:54:46,985 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2025-03-09 01:54:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-09 01:54:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 96 states have (on average 2.0) internal successors, (192), 51 states have internal predecessors, (192), 47 states have call successors, (47), 46 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-09 01:54:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:54:46,988 INFO L225 Difference]: With dead ends: 242 [2025-03-09 01:54:46,988 INFO L226 Difference]: Without dead ends: 241 [2025-03-09 01:54:46,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4230 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5553, Invalid=14753, Unknown=0, NotChecked=0, Total=20306 [2025-03-09 01:54:46,992 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 669 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:54:46,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 28 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:54:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-09 01:54:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2025-03-09 01:54:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 191 states have (on average 1.0052356020942408) internal successors, (192), 191 states have internal predecessors, (192), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2025-03-09 01:54:47,010 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 118 [2025-03-09 01:54:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:54:47,010 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2025-03-09 01:54:47,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 96 states have (on average 2.0) internal successors, (192), 51 states have internal predecessors, (192), 47 states have call successors, (47), 46 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:54:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2025-03-09 01:54:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-09 01:54:47,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:54:47,012 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2025-03-09 01:54:47,019 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-09 01:54:47,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:47,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting new_lsegErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, new_lsegErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 01:54:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:54:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2089201272, now seen corresponding path program 5 times [2025-03-09 01:54:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:54:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998034545] [2025-03-09 01:54:47,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:54:47,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:54:47,264 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes. [2025-03-09 01:54:47,959 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 238 of 238 statements. [2025-03-09 01:54:47,960 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-09 01:54:47,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:54:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:54:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:54:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998034545] [2025-03-09 01:54:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998034545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:54:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971168230] [2025-03-09 01:54:52,461 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:54:52,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:54:52,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:54:52,464 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-09 01:54:52,465 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-09 01:54:52,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes.