./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.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-zilu/benchmark10_conjunctive.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 5a9444e5380fed44b00432b26b7edd9414dfa93ba2d2f76306ea753732eae2b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:45:32,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:45:32,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:45:32,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:45:32,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:45:32,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:45:32,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:45:32,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:45:32,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:45:32,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:45:32,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:45:32,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:45:32,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:45:32,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:45:32,997 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:45:32,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:45:32,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:45:32,997 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:45:32,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:45:32,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:45:32,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:45:32,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:45:32,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:45:32,999 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 -> 5a9444e5380fed44b00432b26b7edd9414dfa93ba2d2f76306ea753732eae2b3 [2025-03-04 10:45:33,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:45:33,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:45:33,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:45:33,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:45:33,238 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:45:33,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i [2025-03-04 10:45:34,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908deaf20/f3b6d4af146e4bacb47a8a83b4c8adc9/FLAG92d5ca6bf [2025-03-04 10:45:34,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:45:34,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i [2025-03-04 10:45:34,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908deaf20/f3b6d4af146e4bacb47a8a83b4c8adc9/FLAG92d5ca6bf [2025-03-04 10:45:34,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908deaf20/f3b6d4af146e4bacb47a8a83b4c8adc9 [2025-03-04 10:45:34,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:45:34,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:45:34,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:45:34,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:45:34,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:45:34,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:45:34" (1/1) ... [2025-03-04 10:45:34,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc0bd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:34, skipping insertion in model container [2025-03-04 10:45:34,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:45:34" (1/1) ... [2025-03-04 10:45:34,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:45:35,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:45:35,075 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:45:35,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:45:35,096 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:45:35,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35 WrapperNode [2025-03-04 10:45:35,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:45:35,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:45:35,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:45:35,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:45:35,103 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:45:35" (1/1) ... [2025-03-04 10:45:35,107 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:45:35" (1/1) ... [2025-03-04 10:45:35,117 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 36 [2025-03-04 10:45:35,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:45:35,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:45:35,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:45:35,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:45:35,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,135 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:45:35,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:45:35,144 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:45:35,144 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:45:35,144 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:45:35,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (1/1) ... [2025-03-04 10:45:35,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:45:35,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:35,172 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:45:35,177 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:45:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:45:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:45:35,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:45:35,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:45:35,235 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:45:35,236 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:45:35,310 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 10:45:35,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:45:35,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:45:35,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:45:35,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:45:35 BoogieIcfgContainer [2025-03-04 10:45:35,316 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:45:35,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:45:35,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:45:35,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:45:35,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:45:34" (1/3) ... [2025-03-04 10:45:35,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dd8193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:45:35, skipping insertion in model container [2025-03-04 10:45:35,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:35" (2/3) ... [2025-03-04 10:45:35,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46dd8193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:45:35, skipping insertion in model container [2025-03-04 10:45:35,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:45:35" (3/3) ... [2025-03-04 10:45:35,322 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.i [2025-03-04 10:45:35,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:45:35,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark10_conjunctive.i that has 1 procedures, 21 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-04 10:45:35,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:45:35,380 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;@3e090a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:45:35,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:45:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 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:45:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:45:35,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:35,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:45:35,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:35,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 52454870, now seen corresponding path program 1 times [2025-03-04 10:45:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:35,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266425071] [2025-03-04 10:45:35,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:35,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:45:35,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:45:35,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:35,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:35,515 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:45:35,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:35,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266425071] [2025-03-04 10:45:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266425071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:35,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:35,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:45:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353471862] [2025-03-04 10:45:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:45:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:35,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:45:35,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:35,536 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:35,580 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-03-04 10:45:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:45:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 10:45:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:35,590 INFO L225 Difference]: With dead ends: 29 [2025-03-04 10:45:35,591 INFO L226 Difference]: Without dead ends: 16 [2025-03-04 10:45:35,593 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:45:35,596 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:35,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-04 10:45:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-04 10:45:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 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:45:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-04 10:45:35,617 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2025-03-04 10:45:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:35,617 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-04 10:45:35,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-04 10:45:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:45:35,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:35,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:45:35,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:45:35,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:35,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1626100955, now seen corresponding path program 1 times [2025-03-04 10:45:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547339003] [2025-03-04 10:45:35,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:35,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:35,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:45:35,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:45:35,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:35,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:35,663 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:45:35,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547339003] [2025-03-04 10:45:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547339003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:35,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:35,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:45:35,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676290783] [2025-03-04 10:45:35,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:35,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:45:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:35,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:45:35,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:35,666 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:35,689 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-03-04 10:45:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:45:35,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:45:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:35,690 INFO L225 Difference]: With dead ends: 17 [2025-03-04 10:45:35,690 INFO L226 Difference]: Without dead ends: 16 [2025-03-04 10:45:35,690 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:45:35,691 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:35,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-04 10:45:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 10:45:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 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:45:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-04 10:45:35,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2025-03-04 10:45:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:35,696 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-04 10:45:35,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-04 10:45:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:45:35,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:35,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:45:35,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:45:35,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:35,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:35,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1130477964, now seen corresponding path program 1 times [2025-03-04 10:45:35,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320773637] [2025-03-04 10:45:35,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:35,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:35,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:45:35,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:45:35,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:35,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:35,727 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:45:35,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320773637] [2025-03-04 10:45:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320773637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:35,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:35,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:45:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990282631] [2025-03-04 10:45:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:35,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:45:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:35,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:45:35,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:35,729 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:35,750 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-03-04 10:45:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:45:35,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:45:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:35,751 INFO L225 Difference]: With dead ends: 16 [2025-03-04 10:45:35,751 INFO L226 Difference]: Without dead ends: 15 [2025-03-04 10:45:35,751 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:45:35,752 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:35,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-04 10:45:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 10:45:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 14 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:45:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-04 10:45:35,754 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2025-03-04 10:45:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:35,754 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-04 10:45:35,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-04 10:45:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:45:35,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:35,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:45:35,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:45:35,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash -685078535, now seen corresponding path program 1 times [2025-03-04 10:45:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460195848] [2025-03-04 10:45:35,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:35,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:35,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:45:35,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:45:35,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:35,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:35,790 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:45:35,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:35,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460195848] [2025-03-04 10:45:35,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460195848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:35,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:45:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589483630] [2025-03-04 10:45:35,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:45:35,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:35,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:45:35,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:35,791 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:35,817 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-04 10:45:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:45:35,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:45:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:35,818 INFO L225 Difference]: With dead ends: 18 [2025-03-04 10:45:35,818 INFO L226 Difference]: Without dead ends: 17 [2025-03-04 10:45:35,818 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:45:35,819 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:35,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-04 10:45:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 10:45:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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:45:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-04 10:45:35,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2025-03-04 10:45:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:35,824 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-04 10:45:35,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-04 10:45:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:45:35,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:35,825 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:45:35,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:45:35,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:35,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 509934833, now seen corresponding path program 1 times [2025-03-04 10:45:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668384821] [2025-03-04 10:45:35,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:35,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:35,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:45:35,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:45:35,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:35,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:35,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668384821] [2025-03-04 10:45:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668384821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:35,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:35,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:45:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044870128] [2025-03-04 10:45:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:35,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:45:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:35,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:45:35,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:45:35,880 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:45:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:35,928 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-03-04 10:45:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:45:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:45:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:35,929 INFO L225 Difference]: With dead ends: 17 [2025-03-04 10:45:35,929 INFO L226 Difference]: Without dead ends: 16 [2025-03-04 10:45:35,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:45:35,930 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:35,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-04 10:45:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-04 10:45:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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:45:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-04 10:45:35,934 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2025-03-04 10:45:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:35,934 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-04 10:45:35,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:45:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-04 10:45:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:45:35,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:35,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:45:35,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:45:35,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:35,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1371889376, now seen corresponding path program 1 times [2025-03-04 10:45:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:35,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984349743] [2025-03-04 10:45:35,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:35,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:45:35,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:45:35,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:35,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:36,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984349743] [2025-03-04 10:45:36,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984349743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:45:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109280603] [2025-03-04 10:45:36,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:36,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:36,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:36,019 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:45:36,021 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:45:36,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:45:36,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:45:36,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:36,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:36,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:45:36,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:45:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:36,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:45:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109280603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:45:36,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:45:36,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:45:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121268052] [2025-03-04 10:45:36,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:45:36,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:45:36,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:36,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:45:36,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:45:36,201 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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:45:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:36,280 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-03-04 10:45:36,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:45:36,281 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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:45:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:36,281 INFO L225 Difference]: With dead ends: 28 [2025-03-04 10:45:36,281 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 10:45:36,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:45:36,282 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:36,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:36,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 10:45:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-04 10:45:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-04 10:45:36,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 12 [2025-03-04 10:45:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:36,288 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-04 10:45:36,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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:45:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-04 10:45:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:45:36,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:36,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:45:36,294 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:45:36,489 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,SelfDestructingSolverStorable5 [2025-03-04 10:45:36,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:36,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 169268990, now seen corresponding path program 1 times [2025-03-04 10:45:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:36,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219197286] [2025-03-04 10:45:36,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:36,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:45:36,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:45:36,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:36,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:45:36,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:36,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219197286] [2025-03-04 10:45:36,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219197286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:36,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:36,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:45:36,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826182960] [2025-03-04 10:45:36,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:36,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:45:36,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:36,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:45:36,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:36,518 INFO L87 Difference]: Start difference. First operand 26 states and 27 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:45:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:36,532 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-03-04 10:45:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:45:36,533 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:45:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:36,533 INFO L225 Difference]: With dead ends: 26 [2025-03-04 10:45:36,534 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 10:45:36,534 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:45:36,534 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:36,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 10:45:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 10:45:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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:45:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-04 10:45:36,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 14 [2025-03-04 10:45:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:36,538 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-04 10:45:36,538 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:45:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-04 10:45:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:45:36,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:36,538 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2025-03-04 10:45:36,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:45:36,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:36,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:36,539 INFO L85 PathProgramCache]: Analyzing trace with hash -600116630, now seen corresponding path program 2 times [2025-03-04 10:45:36,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:36,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186562190] [2025-03-04 10:45:36,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:45:36,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:36,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:45:36,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:45:36,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:45:36,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:36,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186562190] [2025-03-04 10:45:36,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186562190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:45:36,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765293667] [2025-03-04 10:45:36,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:45:36,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:36,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:36,680 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:45:36,681 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:45:36,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:45:36,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:45:36,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:45:36,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:36,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:45:36,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:45:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:36,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:45:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:36,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765293667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:45:36,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:45:36,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 10:45:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490952072] [2025-03-04 10:45:36,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:45:36,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:45:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:36,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:45:36,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:45:36,955 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 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:45:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:37,208 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-03-04 10:45:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:45:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 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 24 [2025-03-04 10:45:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:37,209 INFO L225 Difference]: With dead ends: 50 [2025-03-04 10:45:37,209 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 10:45:37,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=413, Invalid=919, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:45:37,210 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:37,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 16 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:45:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 10:45:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 10:45:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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:45:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2025-03-04 10:45:37,215 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 24 [2025-03-04 10:45:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:37,215 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2025-03-04 10:45:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 22 states have internal predecessors, (65), 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:45:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2025-03-04 10:45:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:45:37,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:37,216 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1] [2025-03-04 10:45:37,226 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:45:37,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 10:45:37,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 494745598, now seen corresponding path program 3 times [2025-03-04 10:45:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:37,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755322986] [2025-03-04 10:45:37,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:45:37,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:37,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 8 equivalence classes. [2025-03-04 10:45:37,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:45:37,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:45:37,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755322986] [2025-03-04 10:45:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755322986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:45:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118472753] [2025-03-04 10:45:37,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:45:37,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:37,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:37,685 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:45:37,687 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:45:37,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 8 equivalence classes. [2025-03-04 10:45:37,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:45:37,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:45:37,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:37,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:45:37,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:45:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:37,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:45:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118472753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:45:38,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:45:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2025-03-04 10:45:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134367280] [2025-03-04 10:45:38,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:45:38,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 10:45:38,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 10:45:38,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:45:38,304 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 40 states, 39 states have (on average 3.051282051282051) internal successors, (119), 40 states have internal predecessors, (119), 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:45:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:39,404 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2025-03-04 10:45:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:45:39,405 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.051282051282051) internal successors, (119), 40 states have internal predecessors, (119), 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 48 [2025-03-04 10:45:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:39,406 INFO L225 Difference]: With dead ends: 98 [2025-03-04 10:45:39,406 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 10:45:39,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1819, Invalid=4343, Unknown=0, NotChecked=0, Total=6162 [2025-03-04 10:45:39,409 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:39,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 18 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:45:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 10:45:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 10:45:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 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:45:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2025-03-04 10:45:39,424 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 48 [2025-03-04 10:45:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:39,424 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2025-03-04 10:45:39,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.051282051282051) internal successors, (119), 40 states have internal predecessors, (119), 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:45:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2025-03-04 10:45:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:45:39,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:39,428 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1] [2025-03-04 10:45:39,434 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:45:39,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:39,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:39,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1891520294, now seen corresponding path program 4 times [2025-03-04 10:45:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165616511] [2025-03-04 10:45:39,629 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:45:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:39,636 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-03-04 10:45:39,650 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:45:39,653 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:45:39,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165616511] [2025-03-04 10:45:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165616511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:45:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34207485] [2025-03-04 10:45:40,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:45:40,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:40,255 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:45:40,256 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:45:40,274 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 96 statements into 2 equivalence classes. [2025-03-04 10:45:40,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:45:40,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:45:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:40,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:45:40,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:45:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:40,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:45:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34207485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:45:42,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:45:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 85 [2025-03-04 10:45:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980796294] [2025-03-04 10:45:42,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:45:42,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2025-03-04 10:45:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:42,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2025-03-04 10:45:42,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1335, Invalid=5975, Unknown=0, NotChecked=0, Total=7310 [2025-03-04 10:45:42,055 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand has 86 states, 85 states have (on average 3.023529411764706) internal successors, (257), 86 states have internal predecessors, (257), 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:45:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:45,662 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2025-03-04 10:45:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-03-04 10:45:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.023529411764706) internal successors, (257), 86 states have internal predecessors, (257), 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 96 [2025-03-04 10:45:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:45,664 INFO L225 Difference]: With dead ends: 200 [2025-03-04 10:45:45,664 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 10:45:45,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12015 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=9174, Invalid=24866, Unknown=0, NotChecked=0, Total=34040 [2025-03-04 10:45:45,670 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 389 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:45,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 31 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:45:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 10:45:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-04 10:45:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.005050505050505) internal successors, (199), 198 states have internal predecessors, (199), 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:45:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2025-03-04 10:45:45,683 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 96 [2025-03-04 10:45:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:45,683 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2025-03-04 10:45:45,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.023529411764706) internal successors, (257), 86 states have internal predecessors, (257), 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:45:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2025-03-04 10:45:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 10:45:45,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:45,686 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 1, 1, 1, 1] [2025-03-04 10:45:45,691 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:45:45,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:45,890 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:45:45,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 41212283, now seen corresponding path program 5 times [2025-03-04 10:45:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202298898] [2025-03-04 10:45:45,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:45:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:45,900 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 198 statements into 33 equivalence classes. [2025-03-04 10:45:45,938 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 10:45:45,938 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-04 10:45:45,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:47,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202298898] [2025-03-04 10:45:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202298898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:45:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126659823] [2025-03-04 10:45:47,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:45:47,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:47,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:45:47,933 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:45:47,953 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 198 statements into 33 equivalence classes. [2025-03-04 10:45:47,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 10:45:47,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-04 10:45:47,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:47,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-04 10:45:47,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:45:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:50,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:45:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 3072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126659823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:45:53,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:45:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 67, 67] total 195 [2025-03-04 10:45:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352366726] [2025-03-04 10:45:53,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:45:53,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 196 states [2025-03-04 10:45:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:53,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2025-03-04 10:45:53,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7063, Invalid=31157, Unknown=0, NotChecked=0, Total=38220 [2025-03-04 10:45:53,908 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand has 196 states, 195 states have (on average 2.994871794871795) internal successors, (584), 196 states have internal predecessors, (584), 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:46:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:46:12,149 INFO L93 Difference]: Finished difference Result 416 states and 451 transitions. [2025-03-04 10:46:12,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2025-03-04 10:46:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 196 states, 195 states have (on average 2.994871794871795) internal successors, (584), 196 states have internal predecessors, (584), 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 198 [2025-03-04 10:46:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:46:12,151 INFO L225 Difference]: With dead ends: 416 [2025-03-04 10:46:12,151 INFO L226 Difference]: Without dead ends: 415 [2025-03-04 10:46:12,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58312 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=47372, Invalid=102784, Unknown=0, NotChecked=0, Total=150156 [2025-03-04 10:46:12,159 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2027 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 752 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:46:12,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 77 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [752 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:46:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-04 10:46:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-04 10:46:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.002415458937198) internal successors, (415), 414 states have internal predecessors, (415), 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:46:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2025-03-04 10:46:12,175 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 198 [2025-03-04 10:46:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:46:12,176 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2025-03-04 10:46:12,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 196 states, 195 states have (on average 2.994871794871795) internal successors, (584), 196 states have internal predecessors, (584), 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:46:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2025-03-04 10:46:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-04 10:46:12,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:46:12,180 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 1, 1, 1, 1] [2025-03-04 10:46:12,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:46:12,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:46:12,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:46:12,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:46:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash -294330193, now seen corresponding path program 6 times [2025-03-04 10:46:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:46:12,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707184158] [2025-03-04 10:46:12,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:46:12,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:46:12,394 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 414 statements into 69 equivalence classes. [2025-03-04 10:46:12,473 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 10:46:12,473 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) [2025-03-04 10:46:12,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:46:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:46:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:46:19,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707184158] [2025-03-04 10:46:19,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707184158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:46:19,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420826279] [2025-03-04 10:46:19,772 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:46:19,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:46:19,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:46:19,774 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:46:19,774 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:46:19,802 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 414 statements into 69 equivalence classes. [2025-03-04 10:46:19,890 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 10:46:19,890 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) [2025-03-04 10:46:19,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:46:19,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-03-04 10:46:19,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:46:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:46:28,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:46:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:46:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420826279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:46:41,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:46:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138, 138] total 412 [2025-03-04 10:46:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049102598] [2025-03-04 10:46:41,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:46:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 413 states [2025-03-04 10:46:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:46:41,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 413 interpolants. [2025-03-04 10:46:41,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37320, Invalid=132836, Unknown=0, NotChecked=0, Total=170156 [2025-03-04 10:46:41,778 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand has 413 states, 412 states have (on average 3.004854368932039) internal successors, (1238), 413 states have internal predecessors, (1238), 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)