./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1ab1611c68b20ff5721c195b0d2c7506cb1678fd2a0003f8a2214f630d652abe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:15,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:15,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:15,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:15,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:15,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:15,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:15,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:15,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:15,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:15,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:15,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:15,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:15,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:15,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:15,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:15,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:15,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:15,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ab1611c68b20ff5721c195b0d2c7506cb1678fd2a0003f8a2214f630d652abe [2025-03-04 10:32:15,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:15,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:15,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:15,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:15,526 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:15,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.c [2025-03-04 10:32:16,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6619822d2/e169936dfd9447da8b21f31e2df67a9c/FLAGbb638ed41 [2025-03-04 10:32:16,868 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:16,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex5.c [2025-03-04 10:32:16,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6619822d2/e169936dfd9447da8b21f31e2df67a9c/FLAGbb638ed41 [2025-03-04 10:32:16,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6619822d2/e169936dfd9447da8b21f31e2df67a9c [2025-03-04 10:32:16,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:16,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:16,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:16,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:16,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:16,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:16" (1/1) ... [2025-03-04 10:32:16,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb799e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:16, skipping insertion in model container [2025-03-04 10:32:16,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:16" (1/1) ... [2025-03-04 10:32:16,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:17,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:17,031 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:17,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:17,047 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:17,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17 WrapperNode [2025-03-04 10:32:17,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:17,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:17,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:17,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:17,053 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:32:17" (1/1) ... [2025-03-04 10:32:17,055 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:32:17" (1/1) ... [2025-03-04 10:32:17,065 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 16 [2025-03-04 10:32:17,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:17,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:17,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:17,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:17,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,075 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:32:17,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:17,081 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:17,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:17,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:17,082 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (1/1) ... [2025-03-04 10:32:17,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:17,109 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:32:17,111 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:32:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-04 10:32:17,128 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-04 10:32:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:17,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:17,162 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:17,164 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:17,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret1; [2025-03-04 10:32:17,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: havoc #t~ret0; [2025-03-04 10:32:17,265 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:17,266 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:17,273 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:17,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:17,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:17 BoogieIcfgContainer [2025-03-04 10:32:17,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:17,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:17,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:17,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:17,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:16" (1/3) ... [2025-03-04 10:32:17,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ef2596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:17, skipping insertion in model container [2025-03-04 10:32:17,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:17" (2/3) ... [2025-03-04 10:32:17,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ef2596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:17, skipping insertion in model container [2025-03-04 10:32:17,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:17" (3/3) ... [2025-03-04 10:32:17,283 INFO L128 eAbstractionObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex5.c [2025-03-04 10:32:17,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:17,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LeeJonesBen-Amram-POPL2001-Ex5.c that has 2 procedures, 26 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 10:32:17,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:17,346 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;@70f58baa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:17,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:32:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:32:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:32:17,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:17,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:17,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:17,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1312928154, now seen corresponding path program 1 times [2025-03-04 10:32:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114078467] [2025-03-04 10:32:17,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:32:17,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:32:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,535 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:32:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:17,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114078467] [2025-03-04 10:32:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114078467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:17,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174596501] [2025-03-04 10:32:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:17,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:17,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:17,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:17,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:17,557 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:17,635 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-04 10:32:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:32:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:17,640 INFO L225 Difference]: With dead ends: 47 [2025-03-04 10:32:17,640 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 10:32:17,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:17,644 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:17,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 10:32:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2025-03-04 10:32:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-03-04 10:32:17,666 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2025-03-04 10:32:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:17,666 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-03-04 10:32:17,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-03-04 10:32:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:32:17,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:17,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:17,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:17,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:17,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1312928192, now seen corresponding path program 1 times [2025-03-04 10:32:17,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852630397] [2025-03-04 10:32:17,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:32:17,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:32:17,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,705 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:32:17,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:17,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852630397] [2025-03-04 10:32:17,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852630397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:17,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:17,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:17,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990271703] [2025-03-04 10:32:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:17,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:17,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:17,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:17,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:17,707 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:17,743 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-04 10:32:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:17,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:32:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:17,744 INFO L225 Difference]: With dead ends: 29 [2025-03-04 10:32:17,744 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 10:32:17,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:17,745 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:17,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 10:32:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2025-03-04 10:32:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-04 10:32:17,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2025-03-04 10:32:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:17,748 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-04 10:32:17,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-04 10:32:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:17,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:17,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:17,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:17,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:17,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2046067129, now seen corresponding path program 1 times [2025-03-04 10:32:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032744652] [2025-03-04 10:32:17,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:17,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:17,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,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:32:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032744652] [2025-03-04 10:32:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032744652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742854378] [2025-03-04 10:32:17,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:17,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:17,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:17,792 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:17,838 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-04 10:32:17,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:17,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:32:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:17,840 INFO L225 Difference]: With dead ends: 28 [2025-03-04 10:32:17,840 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 10:32:17,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:17,841 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:17,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 10:32:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-04 10:32:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-04 10:32:17,847 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 9 [2025-03-04 10:32:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-04 10:32:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-04 10:32:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:17,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:17,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:17,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:17,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:17,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2046068314, now seen corresponding path program 1 times [2025-03-04 10:32:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210995805] [2025-03-04 10:32:17,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:17,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:17,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:17,900 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:32:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:17,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210995805] [2025-03-04 10:32:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210995805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:17,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:17,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804670780] [2025-03-04 10:32:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:17,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:17,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:17,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:17,902 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:17,931 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2025-03-04 10:32:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:32:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:17,932 INFO L225 Difference]: With dead ends: 36 [2025-03-04 10:32:17,932 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:32:17,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:17,934 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:17,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:32:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2025-03-04 10:32:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-04 10:32:17,938 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 9 [2025-03-04 10:32:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:17,940 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-04 10:32:17,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-04 10:32:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:32:17,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:17,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:17,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:32:17,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:17,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash 78765591, now seen corresponding path program 1 times [2025-03-04 10:32:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:17,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918455612] [2025-03-04 10:32:17,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:17,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:17,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:17,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:17,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:18,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918455612] [2025-03-04 10:32:18,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918455612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:18,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606524059] [2025-03-04 10:32:18,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:18,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:18,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:18,064 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:32:18,065 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:32:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:18,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:18,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:18,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:18,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:18,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:18,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606524059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:18,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:32:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34441800] [2025-03-04 10:32:18,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:18,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:32:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:18,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:32:18,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:18,243 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:18,538 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-03-04 10:32:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:32:18,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 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:32:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:18,540 INFO L225 Difference]: With dead ends: 91 [2025-03-04 10:32:18,540 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 10:32:18,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:32:18,541 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 83 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:18,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 74 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 10:32:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2025-03-04 10:32:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 51 states have internal predecessors, (64), 9 states have call successors, (9), 8 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2025-03-04 10:32:18,555 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 14 [2025-03-04 10:32:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:18,555 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2025-03-04 10:32:18,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2025-03-04 10:32:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:32:18,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:18,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:18,564 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:32:18,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:18,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:18,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 78765553, now seen corresponding path program 1 times [2025-03-04 10:32:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:18,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856802014] [2025-03-04 10:32:18,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:18,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:18,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:18,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:18,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,835 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:32:18,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:18,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856802014] [2025-03-04 10:32:18,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856802014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:18,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927448020] [2025-03-04 10:32:18,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:18,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:18,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:18,837 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:32:18,839 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:32:18,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:18,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:18,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:18,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:18,875 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:32:18,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:18,929 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:32:18,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927448020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:18,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:18,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:32:18,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558597343] [2025-03-04 10:32:18,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:18,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:32:18,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:18,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:32:18,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:18,930 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:19,138 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2025-03-04 10:32:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:32:19,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 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:32:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:19,140 INFO L225 Difference]: With dead ends: 101 [2025-03-04 10:32:19,140 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 10:32:19,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:32:19,140 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:19,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 71 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 10:32:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2025-03-04 10:32:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.360655737704918) internal successors, (83), 65 states have internal predecessors, (83), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2025-03-04 10:32:19,156 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 14 [2025-03-04 10:32:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:19,156 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2025-03-04 10:32:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2025-03-04 10:32:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:32:19,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:19,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:19,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:32:19,358 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,SelfDestructingSolverStorable5 [2025-03-04 10:32:19,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1853233994, now seen corresponding path program 1 times [2025-03-04 10:32:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244574775] [2025-03-04 10:32:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:19,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:19,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:19,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:19,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:19,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244574775] [2025-03-04 10:32:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244574775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121900813] [2025-03-04 10:32:19,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:19,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:19,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:19,415 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:32:19,428 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:32:19,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:19,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:19,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:19,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:19,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:32:19,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:19,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121900813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:19,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:19,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:32:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448539350] [2025-03-04 10:32:19,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:32:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:19,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:32:19,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:32:19,522 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:19,599 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2025-03-04 10:32:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:32:19,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:32:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:19,600 INFO L225 Difference]: With dead ends: 77 [2025-03-04 10:32:19,600 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 10:32:19,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:32:19,601 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:19,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 37 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 10:32:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2025-03-04 10:32:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 57 states have internal predecessors, (67), 11 states have call successors, (11), 10 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-04 10:32:19,607 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 15 [2025-03-04 10:32:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:19,607 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-04 10:32:19,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-04 10:32:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:32:19,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:19,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:32:19,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:32:19,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:19,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1772463200, now seen corresponding path program 1 times [2025-03-04 10:32:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786729346] [2025-03-04 10:32:19,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:19,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:32:19,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:32:19,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:19,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786729346] [2025-03-04 10:32:19,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786729346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61847208] [2025-03-04 10:32:19,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:19,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:19,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:19,893 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:32:19,895 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:32:19,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:32:19,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:32:19,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:19,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:19,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:32:19,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:19,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:20,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61847208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:20,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:20,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-04 10:32:20,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025310039] [2025-03-04 10:32:20,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:20,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:32:20,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:20,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:32:20,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:32:20,096 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:20,930 INFO L93 Difference]: Finished difference Result 241 states and 280 transitions. [2025-03-04 10:32:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-04 10:32:20,931 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 10:32:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:20,932 INFO L225 Difference]: With dead ends: 241 [2025-03-04 10:32:20,934 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 10:32:20,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=783, Invalid=3773, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:32:20,937 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 452 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:20,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 84 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 10:32:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 120. [2025-03-04 10:32:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.202020202020202) internal successors, (119), 100 states have internal predecessors, (119), 19 states have call successors, (19), 19 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2025-03-04 10:32:20,972 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 20 [2025-03-04 10:32:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:20,972 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2025-03-04 10:32:20,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 8 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2025-03-04 10:32:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:32:20,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:20,973 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:20,979 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:32:21,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:21,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:21,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:21,174 INFO L85 PathProgramCache]: Analyzing trace with hash -182531054, now seen corresponding path program 1 times [2025-03-04 10:32:21,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:21,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347825518] [2025-03-04 10:32:21,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:21,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:21,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:32:21,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:32:21,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:21,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:32:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347825518] [2025-03-04 10:32:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347825518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:21,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073252319] [2025-03-04 10:32:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:21,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:21,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:21,226 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:21,264 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2025-03-04 10:32:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 10:32:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:21,265 INFO L225 Difference]: With dead ends: 124 [2025-03-04 10:32:21,265 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 10:32:21,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:32:21,265 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:21,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 47 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 10:32:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-04 10:32:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 99 states have internal predecessors, (117), 19 states have call successors, (19), 19 states have call predecessors, (19), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2025-03-04 10:32:21,279 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 26 [2025-03-04 10:32:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:21,279 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2025-03-04 10:32:21,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2025-03-04 10:32:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:32:21,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:21,280 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:32:21,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash 339857656, now seen corresponding path program 1 times [2025-03-04 10:32:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:21,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127250398] [2025-03-04 10:32:21,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:21,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:21,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:32:21,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:32:21,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:21,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127250398] [2025-03-04 10:32:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127250398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727558265] [2025-03-04 10:32:21,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:21,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:21,390 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:32:21,392 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:32:21,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:32:21,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:32:21,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:21,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:21,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:32:21,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:21,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:21,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727558265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:21,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:21,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-04 10:32:21,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055600546] [2025-03-04 10:32:21,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:21,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:32:21,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:21,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:32:21,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:32:21,544 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 20 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 12 states have internal predecessors, (42), 8 states have call successors, (8), 8 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:21,914 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2025-03-04 10:32:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:32:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 12 states have internal predecessors, (42), 8 states have call successors, (8), 8 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 10:32:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:21,915 INFO L225 Difference]: With dead ends: 189 [2025-03-04 10:32:21,915 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 10:32:21,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=1405, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 10:32:21,917 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:21,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 99 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 10:32:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 149. [2025-03-04 10:32:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.1788617886178863) internal successors, (145), 124 states have internal predecessors, (145), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2025-03-04 10:32:21,928 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 26 [2025-03-04 10:32:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:21,928 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2025-03-04 10:32:21,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 12 states have internal predecessors, (42), 8 states have call successors, (8), 8 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2025-03-04 10:32:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:32:21,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:21,929 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:21,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:22,129 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,SelfDestructingSolverStorable9 [2025-03-04 10:32:22,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:22,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1388201362, now seen corresponding path program 2 times [2025-03-04 10:32:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:22,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783972842] [2025-03-04 10:32:22,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:22,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:32:22,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:32:22,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:22,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:32:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783972842] [2025-03-04 10:32:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783972842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068285592] [2025-03-04 10:32:22,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:22,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:22,174 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:32:22,176 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:32:22,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:32:22,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:32:22,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:22,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:22,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:32:22,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:32:22,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:22,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068285592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:22,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:22,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 8] total 17 [2025-03-04 10:32:22,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221853923] [2025-03-04 10:32:22,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:22,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:32:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:22,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:32:22,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:32:22,376 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (10), 7 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:22,544 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2025-03-04 10:32:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:32:22,544 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (10), 7 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 10:32:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:22,545 INFO L225 Difference]: With dead ends: 183 [2025-03-04 10:32:22,545 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 10:32:22,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:32:22,546 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:22,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 94 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 10:32:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2025-03-04 10:32:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2025-03-04 10:32:22,550 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 26 [2025-03-04 10:32:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:22,550 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2025-03-04 10:32:22,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (10), 7 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2025-03-04 10:32:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:32:22,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:22,551 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:22,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:22,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:22,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:22,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1084518423, now seen corresponding path program 2 times [2025-03-04 10:32:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751682449] [2025-03-04 10:32:22,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:22,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:32:22,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:22,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:22,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751682449] [2025-03-04 10:32:22,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751682449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570893343] [2025-03-04 10:32:22,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:22,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:22,872 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:22,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:32:22,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:32:22,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:32:22,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:22,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:32:22,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:22,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:23,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570893343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:23,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 10:32:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191719587] [2025-03-04 10:32:23,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:23,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:32:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:23,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:32:23,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:32:23,065 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 14 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:23,456 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2025-03-04 10:32:23,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 10:32:23,457 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 14 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 10:32:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:23,457 INFO L225 Difference]: With dead ends: 106 [2025-03-04 10:32:23,457 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 10:32:23,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=487, Invalid=1963, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 10:32:23,458 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 83 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:23,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 103 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 10:32:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2025-03-04 10:32:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 16 states have call successors, (16), 16 states have call predecessors, (16), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2025-03-04 10:32:23,470 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 32 [2025-03-04 10:32:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:23,470 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2025-03-04 10:32:23,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 14 states have internal predecessors, (52), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2025-03-04 10:32:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:32:23,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:23,472 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-04 10:32:23,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:23,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:23,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:23,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash 97691980, now seen corresponding path program 2 times [2025-03-04 10:32:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:23,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932879879] [2025-03-04 10:32:23,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:23,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:32:23,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:32:23,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:23,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932879879] [2025-03-04 10:32:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932879879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769492995] [2025-03-04 10:32:23,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:23,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:23,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:23,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:32:23,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:32:23,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:32:23,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:23,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:23,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:32:23,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:23,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769492995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:24,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-03-04 10:32:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767814885] [2025-03-04 10:32:24,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:24,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:32:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:24,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:32:24,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:32:24,164 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 32 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 18 states have internal predecessors, (72), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:24,476 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2025-03-04 10:32:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 10:32:24,480 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 18 states have internal predecessors, (72), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-04 10:32:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:24,482 INFO L225 Difference]: With dead ends: 141 [2025-03-04 10:32:24,482 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 10:32:24,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=423, Invalid=2229, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:32:24,483 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 105 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:24,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 138 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 10:32:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2025-03-04 10:32:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 21 states have call successors, (21), 21 states have call predecessors, (21), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2025-03-04 10:32:24,507 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 44 [2025-03-04 10:32:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:24,507 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2025-03-04 10:32:24,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 18 states have internal predecessors, (72), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2025-03-04 10:32:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:32:24,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:24,510 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2025-03-04 10:32:24,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:32:24,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:32:24,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:24,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2145345695, now seen corresponding path program 3 times [2025-03-04 10:32:24,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:24,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059522562] [2025-03-04 10:32:24,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:24,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 10 equivalence classes. [2025-03-04 10:32:24,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:32:24,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 10:32:24,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059522562] [2025-03-04 10:32:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059522562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975114814] [2025-03-04 10:32:25,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:25,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:25,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:25,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:25,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:32:25,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 10 equivalence classes. [2025-03-04 10:32:25,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:32:25,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 10:32:25,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:25,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:32:25,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:25,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975114814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:25,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:25,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2025-03-04 10:32:25,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429836669] [2025-03-04 10:32:25,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:25,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-04 10:32:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:25,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-04 10:32:25,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:32:25,488 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand has 44 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 24 states have internal predecessors, (102), 20 states have call successors, (20), 20 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:26,699 INFO L93 Difference]: Finished difference Result 246 states and 262 transitions. [2025-03-04 10:32:26,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 10:32:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 24 states have internal predecessors, (102), 20 states have call successors, (20), 20 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-04 10:32:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:26,700 INFO L225 Difference]: With dead ends: 246 [2025-03-04 10:32:26,700 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 10:32:26,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2251, Invalid=9739, Unknown=0, NotChecked=0, Total=11990 [2025-03-04 10:32:26,703 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 595 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:26,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 85 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 10:32:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 238. [2025-03-04 10:32:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 198 states have (on average 1.0252525252525253) internal successors, (203), 198 states have internal predecessors, (203), 39 states have call successors, (39), 39 states have call predecessors, (39), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 242 transitions. [2025-03-04 10:32:26,723 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 242 transitions. Word has length 62 [2025-03-04 10:32:26,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:26,724 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 242 transitions. [2025-03-04 10:32:26,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 24 states have internal predecessors, (102), 20 states have call successors, (20), 20 states have call predecessors, (20), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2025-03-04 10:32:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:32:26,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:26,725 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2025-03-04 10:32:26,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:26,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:32:26,926 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:26,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -979694124, now seen corresponding path program 4 times [2025-03-04 10:32:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848669866] [2025-03-04 10:32:26,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:26,930 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:32:26,941 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:32:26,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:26,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:27,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848669866] [2025-03-04 10:32:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848669866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803912633] [2025-03-04 10:32:27,469 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:27,471 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:27,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:32:27,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:32:27,512 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:32:27,512 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:27,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:27,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 10:32:27,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:27,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803912633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:28,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:28,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2025-03-04 10:32:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338409720] [2025-03-04 10:32:28,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:28,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-04 10:32:28,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:28,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-04 10:32:28,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=3484, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:32:28,204 INFO L87 Difference]: Start difference. First operand 238 states and 242 transitions. Second operand has 64 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 34 states have internal predecessors, (152), 30 states have call successors, (30), 30 states have call predecessors, (30), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:28,996 INFO L93 Difference]: Finished difference Result 305 states and 313 transitions. [2025-03-04 10:32:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 10:32:28,996 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 34 states have internal predecessors, (152), 30 states have call successors, (30), 30 states have call predecessors, (30), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-04 10:32:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:28,997 INFO L225 Difference]: With dead ends: 305 [2025-03-04 10:32:28,998 INFO L226 Difference]: Without dead ends: 304 [2025-03-04 10:32:29,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1735, Invalid=9821, Unknown=0, NotChecked=0, Total=11556 [2025-03-04 10:32:29,001 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 421 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:29,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 223 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-04 10:32:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2025-03-04 10:32:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 243 states have (on average 1.0246913580246915) internal successors, (249), 243 states have internal predecessors, (249), 48 states have call successors, (48), 48 states have call predecessors, (48), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 297 transitions. [2025-03-04 10:32:29,026 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 297 transitions. Word has length 92 [2025-03-04 10:32:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:29,026 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 297 transitions. [2025-03-04 10:32:29,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 34 states have internal predecessors, (152), 30 states have call successors, (30), 30 states have call predecessors, (30), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 297 transitions. [2025-03-04 10:32:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 10:32:29,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:29,028 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:29,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:29,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:32:29,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:29,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1941893895, now seen corresponding path program 3 times [2025-03-04 10:32:29,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:29,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045805199] [2025-03-04 10:32:29,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:29,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:29,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 21 equivalence classes. [2025-03-04 10:32:29,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 10:32:29,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-03-04 10:32:29,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045805199] [2025-03-04 10:32:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045805199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622450629] [2025-03-04 10:32:29,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:29,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:29,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:29,981 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:29,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:32:30,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 21 equivalence classes. [2025-03-04 10:32:30,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 10:32:30,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-03-04 10:32:30,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:30,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 10:32:30,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:30,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622450629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:31,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:31,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2025-03-04 10:32:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520544606] [2025-03-04 10:32:31,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:31,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-03-04 10:32:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:31,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-03-04 10:32:31,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1016, Invalid=6640, Unknown=0, NotChecked=0, Total=7656 [2025-03-04 10:32:31,088 INFO L87 Difference]: Start difference. First operand 292 states and 297 transitions. Second operand has 88 states, 85 states have (on average 2.4941176470588236) internal successors, (212), 46 states have internal predecessors, (212), 42 states have call successors, (42), 42 states have call predecessors, (42), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:34,451 INFO L93 Difference]: Finished difference Result 494 states and 524 transitions. [2025-03-04 10:32:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2025-03-04 10:32:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 85 states have (on average 2.4941176470588236) internal successors, (212), 46 states have internal predecessors, (212), 42 states have call successors, (42), 42 states have call predecessors, (42), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-04 10:32:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:34,454 INFO L225 Difference]: With dead ends: 494 [2025-03-04 10:32:34,454 INFO L226 Difference]: Without dead ends: 493 [2025-03-04 10:32:34,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16738 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=9399, Invalid=41451, Unknown=0, NotChecked=0, Total=50850 [2025-03-04 10:32:34,458 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 517 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:34,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 227 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:32:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-04 10:32:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2025-03-04 10:32:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 403 states have (on average 1.0173697270471465) internal successors, (410), 403 states have internal predecessors, (410), 80 states have call successors, (80), 80 states have call predecessors, (80), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 490 transitions. [2025-03-04 10:32:34,498 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 490 transitions. Word has length 128 [2025-03-04 10:32:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:34,499 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 490 transitions. [2025-03-04 10:32:34,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 85 states have (on average 2.4941176470588236) internal successors, (212), 46 states have internal predecessors, (212), 42 states have call successors, (42), 42 states have call predecessors, (42), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 490 transitions. [2025-03-04 10:32:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 10:32:34,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:34,500 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2025-03-04 10:32:34,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:34,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:32:34,701 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:34,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1609480476, now seen corresponding path program 5 times [2025-03-04 10:32:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129721481] [2025-03-04 10:32:34,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:34,708 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 31 equivalence classes. [2025-03-04 10:32:34,765 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 10:32:34,765 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-04 10:32:34,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 2730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129721481] [2025-03-04 10:32:36,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129721481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772950438] [2025-03-04 10:32:36,101 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:36,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:36,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:36,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:32:36,130 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 188 statements into 31 equivalence classes. [2025-03-04 10:32:36,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 10:32:36,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-04 10:32:36,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:36,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 10:32:36,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 2730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:36,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 0 proven. 2730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772950438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:38,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2025-03-04 10:32:38,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539140888] [2025-03-04 10:32:38,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:38,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-04 10:32:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:38,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-04 10:32:38,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2116, Invalid=14140, Unknown=0, NotChecked=0, Total=16256 [2025-03-04 10:32:38,252 INFO L87 Difference]: Start difference. First operand 484 states and 490 transitions. Second operand has 128 states, 125 states have (on average 2.496) internal successors, (312), 66 states have internal predecessors, (312), 62 states have call successors, (62), 62 states have call predecessors, (62), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:40,793 INFO L93 Difference]: Finished difference Result 629 states and 645 transitions. [2025-03-04 10:32:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2025-03-04 10:32:40,793 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 125 states have (on average 2.496) internal successors, (312), 66 states have internal predecessors, (312), 62 states have call successors, (62), 62 states have call predecessors, (62), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-03-04 10:32:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:40,795 INFO L225 Difference]: With dead ends: 629 [2025-03-04 10:32:40,796 INFO L226 Difference]: Without dead ends: 628 [2025-03-04 10:32:40,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14653 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7047, Invalid=41133, Unknown=0, NotChecked=0, Total=48180 [2025-03-04 10:32:40,798 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1069 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:40,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 327 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:32:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-04 10:32:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 610. [2025-03-04 10:32:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 508 states have (on average 1.0236220472440944) internal successors, (520), 508 states have internal predecessors, (520), 101 states have call successors, (101), 101 states have call predecessors, (101), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 621 transitions. [2025-03-04 10:32:40,848 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 621 transitions. Word has length 188 [2025-03-04 10:32:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:40,849 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 621 transitions. [2025-03-04 10:32:40,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 125 states have (on average 2.496) internal successors, (312), 66 states have internal predecessors, (312), 62 states have call successors, (62), 62 states have call predecessors, (62), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 621 transitions. [2025-03-04 10:32:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 10:32:40,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:40,851 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 1, 1, 1, 1, 1] [2025-03-04 10:32:40,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:32:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:32:41,052 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:32:41,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:41,052 INFO L85 PathProgramCache]: Analyzing trace with hash -455112001, now seen corresponding path program 6 times [2025-03-04 10:32:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:41,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186204678] [2025-03-04 10:32:41,053 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:32:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:41,061 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 254 statements into 42 equivalence classes. [2025-03-04 10:32:41,136 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 10:32:41,139 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2025-03-04 10:32:41,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5084 backedges. 0 proven. 5084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:43,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:43,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186204678] [2025-03-04 10:32:43,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186204678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:43,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777123152] [2025-03-04 10:32:43,359 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:32:43,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:43,361 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:43,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:32:43,390 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 254 statements into 42 equivalence classes. [2025-03-04 10:32:43,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 10:32:43,515 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 42 check-sat command(s) [2025-03-04 10:32:43,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:43,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-03-04 10:32:43,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5084 backedges. 0 proven. 5084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:43,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:47,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5084 backedges. 0 proven. 5084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:47,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777123152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:47,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:47,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2025-03-04 10:32:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136210560] [2025-03-04 10:32:47,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:47,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 172 states [2025-03-04 10:32:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:47,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2025-03-04 10:32:47,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3786, Invalid=25626, Unknown=0, NotChecked=0, Total=29412 [2025-03-04 10:32:47,072 INFO L87 Difference]: Start difference. First operand 610 states and 621 transitions. Second operand has 172 states, 169 states have (on average 2.497041420118343) internal successors, (422), 88 states have internal predecessors, (422), 84 states have call successors, (84), 84 states have call predecessors, (84), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,732 INFO L93 Difference]: Finished difference Result 1022 states and 1086 transitions. [2025-03-04 10:32:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 378 states. [2025-03-04 10:32:59,732 INFO L78 Accepts]: Start accepts. Automaton has has 172 states, 169 states have (on average 2.497041420118343) internal successors, (422), 88 states have internal predecessors, (422), 84 states have call successors, (84), 84 states have call predecessors, (84), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2025-03-04 10:32:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,736 INFO L225 Difference]: With dead ends: 1022 [2025-03-04 10:32:59,736 INFO L226 Difference]: Without dead ends: 1021 [2025-03-04 10:32:59,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71933 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=39019, Invalid=173963, Unknown=0, NotChecked=0, Total=212982 [2025-03-04 10:32:59,743 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2461 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2461 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:59,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2461 Valid, 169 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:32:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-04 10:32:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1006. [2025-03-04 10:32:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 838 states have (on average 1.0155131264916468) internal successors, (851), 838 states have internal predecessors, (851), 167 states have call successors, (167), 167 states have call predecessors, (167), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1018 transitions. [2025-03-04 10:32:59,828 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1018 transitions. Word has length 254 [2025-03-04 10:32:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,829 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1018 transitions. [2025-03-04 10:32:59,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 172 states, 169 states have (on average 2.497041420118343) internal successors, (422), 88 states have internal predecessors, (422), 84 states have call successors, (84), 84 states have call predecessors, (84), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1018 transitions. [2025-03-04 10:32:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-04 10:32:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,833 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 62, 62, 62, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:33:00,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:33:00,034 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:33:00,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash -938247932, now seen corresponding path program 7 times [2025-03-04 10:33:00,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633779991] [2025-03-04 10:33:00,034 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:00,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 10:33:00,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 10:33:00,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:00,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:05,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633779991] [2025-03-04 10:33:05,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633779991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:05,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229425324] [2025-03-04 10:33:05,006 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:05,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:05,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:05,008 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:05,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:33:05,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 10:33:05,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 10:33:05,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:05,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-04 10:33:05,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:05,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:12,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229425324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:12,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:12,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128, 128] total 255 [2025-03-04 10:33:12,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017603976] [2025-03-04 10:33:12,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2025-03-04 10:33:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:12,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2025-03-04 10:33:12,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8324, Invalid=56956, Unknown=0, NotChecked=0, Total=65280 [2025-03-04 10:33:12,221 INFO L87 Difference]: Start difference. First operand 1006 states and 1018 transitions. Second operand has 256 states, 253 states have (on average 2.4980237154150196) internal successors, (632), 130 states have internal predecessors, (632), 126 states have call successors, (126), 126 states have call predecessors, (126), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:21,761 INFO L93 Difference]: Finished difference Result 1281 states and 1313 transitions. [2025-03-04 10:33:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 317 states. [2025-03-04 10:33:21,762 INFO L78 Accepts]: Start accepts. Automaton has has 256 states, 253 states have (on average 2.4980237154150196) internal successors, (632), 130 states have internal predecessors, (632), 126 states have call successors, (126), 126 states have call predecessors, (126), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 380 [2025-03-04 10:33:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:21,766 INFO L225 Difference]: With dead ends: 1281 [2025-03-04 10:33:21,766 INFO L226 Difference]: Without dead ends: 1280 [2025-03-04 10:33:21,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1074 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62525 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=28423, Invalid=168269, Unknown=0, NotChecked=0, Total=196692 [2025-03-04 10:33:21,774 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2265 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:21,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 554 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:33:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-03-04 10:33:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1252. [2025-03-04 10:33:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1043 states have (on average 1.0210930009587729) internal successors, (1065), 1043 states have internal predecessors, (1065), 208 states have call successors, (208), 208 states have call predecessors, (208), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1273 transitions. [2025-03-04 10:33:21,878 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1273 transitions. Word has length 380 [2025-03-04 10:33:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:21,878 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1273 transitions. [2025-03-04 10:33:21,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 256 states, 253 states have (on average 2.4980237154150196) internal successors, (632), 130 states have internal predecessors, (632), 126 states have call successors, (126), 126 states have call predecessors, (126), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1273 transitions. [2025-03-04 10:33:21,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-04 10:33:21,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:21,882 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 84, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:21,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:33:22,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:22,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:33:22,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:22,083 INFO L85 PathProgramCache]: Analyzing trace with hash 4161849, now seen corresponding path program 4 times [2025-03-04 10:33:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:22,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529120291] [2025-03-04 10:33:22,083 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:22,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:22,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 512 statements into 2 equivalence classes. [2025-03-04 10:33:22,267 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 10:33:22,267 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 21002 backedges. 0 proven. 21002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529120291] [2025-03-04 10:33:30,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529120291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186908457] [2025-03-04 10:33:30,980 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:30,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:30,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:30,982 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:30,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:33:31,029 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 512 statements into 2 equivalence classes. [2025-03-04 10:33:31,741 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 10:33:31,741 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:31,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 172 conjuncts are in the unsatisfiable core [2025-03-04 10:33:31,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21002 backedges. 0 proven. 21002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:32,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21002 backedges. 0 proven. 21002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186908457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:44,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [172, 172, 172] total 343 [2025-03-04 10:33:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309912171] [2025-03-04 10:33:44,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:44,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 344 states [2025-03-04 10:33:44,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:44,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 344 interpolants. [2025-03-04 10:33:44,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14968, Invalid=103024, Unknown=0, NotChecked=0, Total=117992 [2025-03-04 10:33:44,240 INFO L87 Difference]: Start difference. First operand 1252 states and 1273 transitions. Second operand has 344 states, 341 states have (on average 2.498533724340176) internal successors, (852), 174 states have internal predecessors, (852), 170 states have call successors, (170), 170 states have call predecessors, (170), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)