./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/loops-crafted-1/mono-crafted_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00e8f12f1d0e3d2fc679744754ceeef2daa37b874cd8db07b5ab8c35684165c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:37:32,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:37:33,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:37:33,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:37:33,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:37:33,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:37:33,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:37:33,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:37:33,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:37:33,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:37:33,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:37:33,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:37:33,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:37:33,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:37:33,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:37:33,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:37:33,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:37:33,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:37:33,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:37:33,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:37:33,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:37:33,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:37:33,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:37:33,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:37:33,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:37:33,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:37:33,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:37:33,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:37:33,036 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00e8f12f1d0e3d2fc679744754ceeef2daa37b874cd8db07b5ab8c35684165c0 [2025-03-03 13:37:33,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:37:33,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:37:33,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:37:33,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:37:33,251 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:37:33,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c [2025-03-03 13:37:34,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98f07661/89d5d8ebec5243ae911e5b53e1dc0e87/FLAG7791838bf [2025-03-03 13:37:34,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:37:34,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c [2025-03-03 13:37:34,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98f07661/89d5d8ebec5243ae911e5b53e1dc0e87/FLAG7791838bf [2025-03-03 13:37:34,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98f07661/89d5d8ebec5243ae911e5b53e1dc0e87 [2025-03-03 13:37:34,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:37:34,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:37:34,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:37:34,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:37:34,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:37:34,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:37:34" (1/1) ... [2025-03-03 13:37:34,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:34, skipping insertion in model container [2025-03-03 13:37:34,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:37:34" (1/1) ... [2025-03-03 13:37:34,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:37:35,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c[318,331] [2025-03-03 13:37:35,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:37:35,053 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:37:35,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c[318,331] [2025-03-03 13:37:35,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:37:35,072 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:37:35,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35 WrapperNode [2025-03-03 13:37:35,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:37:35,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:37:35,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:37:35,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:37:35,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,090 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-03-03 13:37:35,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:37:35,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:37:35,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:37:35,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:37:35,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,104 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:37:35,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:37:35,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:37:35,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:37:35,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:37:35,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (1/1) ... [2025-03-03 13:37:35,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:37:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:35,131 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-03 13:37:35,136 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-03 13:37:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:37:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:37:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:37:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:37:35,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:37:35,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:37:35,262 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 13:37:35,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:37:35,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:37:35,269 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:37:35,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:37:35 BoogieIcfgContainer [2025-03-03 13:37:35,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:37:35,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:37:35,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:37:35,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:37:35,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:37:34" (1/3) ... [2025-03-03 13:37:35,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34b755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:37:35, skipping insertion in model container [2025-03-03 13:37:35,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:35" (2/3) ... [2025-03-03 13:37:35,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b34b755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:37:35, skipping insertion in model container [2025-03-03 13:37:35,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:37:35" (3/3) ... [2025-03-03 13:37:35,279 INFO L128 eAbstractionObserver]: Analyzing ICFG mono-crafted_1.c [2025-03-03 13:37:35,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:37:35,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mono-crafted_1.c that has 1 procedures, 12 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:37:35,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:37:35,343 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;@6d83a84f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:37:35,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:37:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 13:37:35,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:35,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 13:37:35,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:35,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1300681946, now seen corresponding path program 1 times [2025-03-03 13:37:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285324309] [2025-03-03 13:37:35,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:35,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 13:37:35,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 13:37:35,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:35,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:35,505 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-03 13:37:35,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285324309] [2025-03-03 13:37:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285324309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:37:35,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:37:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:37:35,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666265584] [2025-03-03 13:37:35,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:37:35,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:37:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:35,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:37:35,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:35,525 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:35,559 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2025-03-03 13:37:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:37:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-03 13:37:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:35,566 INFO L225 Difference]: With dead ends: 24 [2025-03-03 13:37:35,567 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 13:37:35,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:35,571 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:35,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 13:37:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-03 13:37:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-03-03 13:37:35,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 6 [2025-03-03 13:37:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:35,594 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-03 13:37:35,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2025-03-03 13:37:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:37:35,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:35,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:35,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:37:35,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:35,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash 93296440, now seen corresponding path program 1 times [2025-03-03 13:37:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607435751] [2025-03-03 13:37:35,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:35,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:37:35,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:37:35,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:35,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:35,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607435751] [2025-03-03 13:37:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607435751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:37:35,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:37:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:37:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083187632] [2025-03-03 13:37:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:37:35,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:37:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:35,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:37:35,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:35,662 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:35,676 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2025-03-03 13:37:35,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:37:35,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:37:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:35,676 INFO L225 Difference]: With dead ends: 14 [2025-03-03 13:37:35,676 INFO L226 Difference]: Without dead ends: 11 [2025-03-03 13:37:35,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:37:35,677 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:35,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-03 13:37:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-03 13:37:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-03 13:37:35,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2025-03-03 13:37:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:35,684 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-03 13:37:35,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-03-03 13:37:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 13:37:35,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:35,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:35,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:37:35,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:35,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1402745908, now seen corresponding path program 1 times [2025-03-03 13:37:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157887958] [2025-03-03 13:37:35,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:35,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:37:35,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:37:35,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:35,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:35,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157887958] [2025-03-03 13:37:35,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157887958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:35,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642398634] [2025-03-03 13:37:35,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:35,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:35,752 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-03 13:37:35,754 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-03 13:37:35,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 13:37:35,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 13:37:35,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:35,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:35,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:37:35,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:35,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:37:35,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642398634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:35,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:35,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 13:37:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779881617] [2025-03-03 13:37:35,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:35,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:37:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:35,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:37:35,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:37:35,845 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:35,881 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2025-03-03 13:37:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:37:35,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 13:37:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:35,882 INFO L225 Difference]: With dead ends: 23 [2025-03-03 13:37:35,883 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 13:37:35,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:37:35,884 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:35,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 13:37:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 13:37:35,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-03-03 13:37:35,890 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2025-03-03 13:37:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:35,890 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-03-03 13:37:35,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-03-03 13:37:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:37:35,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:35,891 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:35,897 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-03 13:37:36,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:36,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1971582352, now seen corresponding path program 1 times [2025-03-03 13:37:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384204721] [2025-03-03 13:37:36,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:36,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:37:36,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:37:36,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:36,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:37:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384204721] [2025-03-03 13:37:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384204721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927152739] [2025-03-03 13:37:36,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:36,196 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-03 13:37:36,198 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-03 13:37:36,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:37:36,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:37:36,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:36,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:36,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:37:36,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:37:36,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:37:36,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927152739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:36,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:36,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:37:36,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061105501] [2025-03-03 13:37:36,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:36,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:37:36,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:36,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:37:36,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:37:36,313 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:36,342 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-03-03 13:37:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:37:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:37:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:36,342 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:37:36,342 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 13:37:36,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:37:36,343 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:36,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 13:37:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 13:37:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-03 13:37:36,347 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2025-03-03 13:37:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:36,347 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-03 13:37:36,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-03 13:37:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:37:36,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:36,348 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:36,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:37:36,548 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,SelfDestructingSolverStorable3 [2025-03-03 13:37:36,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:36,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash -947469064, now seen corresponding path program 2 times [2025-03-03 13:37:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:36,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791268922] [2025-03-03 13:37:36,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:36,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:37:36,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:37:36,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:36,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:37:36,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:36,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791268922] [2025-03-03 13:37:36,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791268922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:36,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314330991] [2025-03-03 13:37:36,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:36,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:36,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:36,711 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-03 13:37:36,713 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-03 13:37:36,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-03 13:37:36,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:37:36,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:36,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:36,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:37:36,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:37:36,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:37:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314330991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:36,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-03 13:37:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896076481] [2025-03-03 13:37:36,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:37:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:36,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:37:36,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:37:36,895 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:36,945 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2025-03-03 13:37:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:37:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-03 13:37:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:36,946 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:37:36,946 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:37:36,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:37:36,947 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:36,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:37:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 13:37:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-03 13:37:36,951 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 23 [2025-03-03 13:37:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:36,951 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-03 13:37:36,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-03 13:37:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:37:36,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:36,952 INFO L218 NwaCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:36,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:37:37,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:37,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:37,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash 103227912, now seen corresponding path program 3 times [2025-03-03 13:37:37,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:37,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533272986] [2025-03-03 13:37:37,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:37,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:37,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 17 equivalence classes. [2025-03-03 13:37:37,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 39 statements. [2025-03-03 13:37:37,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:37:37,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533272986] [2025-03-03 13:37:37,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533272986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261189607] [2025-03-03 13:37:37,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:37,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:37,232 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-03 13:37:37,233 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-03 13:37:37,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 17 equivalence classes. [2025-03-03 13:37:37,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 39 statements. [2025-03-03 13:37:37,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:37:37,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:37,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:37:37,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:37,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261189607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:37,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-03 13:37:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332555424] [2025-03-03 13:37:37,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:37,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:37:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:37,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:37:37,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:37:37,536 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:37,557 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2025-03-03 13:37:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:37:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 13:37:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:37,558 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:37:37,558 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 13:37:37,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:37:37,558 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:37,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 13:37:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2025-03-03 13:37:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-03-03 13:37:37,563 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 39 [2025-03-03 13:37:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:37,563 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-03-03 13:37:37,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-03-03 13:37:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:37:37,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:37,564 INFO L218 NwaCegarLoop]: trace histogram [16, 14, 5, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:37,570 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-03 13:37:37,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:37,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:37,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1267220728, now seen corresponding path program 4 times [2025-03-03 13:37:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-03-03 13:37:37,765 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:37:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:37,771 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 13:37:37,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:37:37,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:37:37,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 46 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 13:37:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:37,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-03-03 13:37:37,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942989213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:37,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186818880] [2025-03-03 13:37:37,873 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:37:37,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:37,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:37,875 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-03 13:37:37,876 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-03 13:37:37,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 13:37:37,924 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:37:37,924 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:37:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:37,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:37:37,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:37:38,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:37:38,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186818880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:38,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 17] total 38 [2025-03-03 13:37:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105672851] [2025-03-03 13:37:38,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:38,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 13:37:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:38,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 13:37:38,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=883, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:37:38,506 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:39,085 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2025-03-03 13:37:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 13:37:39,086 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-03 13:37:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:39,086 INFO L225 Difference]: With dead ends: 97 [2025-03-03 13:37:39,086 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 13:37:39,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1603, Invalid=2953, Unknown=0, NotChecked=0, Total=4556 [2025-03-03 13:37:39,088 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:39,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:37:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 13:37:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2025-03-03 13:37:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-03 13:37:39,099 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2025-03-03 13:37:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:39,099 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-03 13:37:39,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-03 13:37:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 13:37:39,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:39,100 INFO L218 NwaCegarLoop]: trace histogram [32, 30, 6, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:39,106 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-03 13:37:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:39,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:39,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2054658012, now seen corresponding path program 5 times [2025-03-03 13:37:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767580371] [2025-03-03 13:37:39,305 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:37:39,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:39,316 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 33 equivalence classes. [2025-03-03 13:37:39,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 13:37:39,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-03 13:37:39,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:37:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767580371] [2025-03-03 13:37:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767580371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251842441] [2025-03-03 13:37:40,224 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:37:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:40,226 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-03 13:37:40,228 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-03 13:37:40,264 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 33 equivalence classes. [2025-03-03 13:37:40,296 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 13:37:40,297 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-03 13:37:40,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:40,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 13:37:40,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:37:40,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:37:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251842441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:41,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2025-03-03 13:37:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523351400] [2025-03-03 13:37:41,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-03 13:37:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:41,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-03 13:37:41,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 13:37:41,430 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 64 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:41,659 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions. [2025-03-03 13:37:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-03 13:37:41,659 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 13:37:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:41,661 INFO L225 Difference]: With dead ends: 156 [2025-03-03 13:37:41,661 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 13:37:41,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 13:37:41,665 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:41,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:37:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 13:37:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-03 13:37:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2025-03-03 13:37:41,686 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 76 [2025-03-03 13:37:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:41,686 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2025-03-03 13:37:41,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.09375) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2025-03-03 13:37:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 13:37:41,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:41,688 INFO L218 NwaCegarLoop]: trace histogram [64, 62, 6, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:41,694 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-03 13:37:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:41,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:41,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash -397997156, now seen corresponding path program 6 times [2025-03-03 13:37:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:41,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283738514] [2025-03-03 13:37:41,892 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:37:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:41,909 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 140 statements into 65 equivalence classes. [2025-03-03 13:37:41,915 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 24 of 140 statements. [2025-03-03 13:37:41,915 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 13:37:41,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 190 proven. 21 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-03 13:37:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283738514] [2025-03-03 13:37:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283738514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533022367] [2025-03-03 13:37:42,002 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:37:42,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:42,026 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-03 13:37:42,026 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-03 13:37:42,076 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 140 statements into 65 equivalence classes. [2025-03-03 13:37:42,088 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 24 of 140 statements. [2025-03-03 13:37:42,088 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 13:37:42,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:42,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:37:42,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 190 proven. 21 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-03 13:37:42,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 190 proven. 21 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-03 13:37:42,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533022367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:42,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:42,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-03 13:37:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732917782] [2025-03-03 13:37:42,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:42,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:37:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:42,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:37:42,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:37:42,687 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:42,724 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2025-03-03 13:37:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:37:42,725 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-03-03 13:37:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:42,726 INFO L225 Difference]: With dead ends: 158 [2025-03-03 13:37:42,726 INFO L226 Difference]: Without dead ends: 155 [2025-03-03 13:37:42,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:37:42,728 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:42,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-03 13:37:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2025-03-03 13:37:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.027027027027027) internal successors, (152), 148 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2025-03-03 13:37:42,757 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 140 [2025-03-03 13:37:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:42,757 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2025-03-03 13:37:42,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2025-03-03 13:37:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 13:37:42,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:42,758 INFO L218 NwaCegarLoop]: trace histogram [64, 62, 14, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:42,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 13:37:42,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:42,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:42,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1293356644, now seen corresponding path program 7 times [2025-03-03 13:37:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870090513] [2025-03-03 13:37:42,960 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:37:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:42,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 13:37:43,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 13:37:43,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:43,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 13:37:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870090513] [2025-03-03 13:37:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870090513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328442107] [2025-03-03 13:37:45,421 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:37:45,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:45,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:45,423 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-03 13:37:45,425 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-03 13:37:45,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 13:37:45,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 13:37:45,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:45,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-03 13:37:45,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 13:37:45,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 13:37:49,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328442107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:49,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:49,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2025-03-03 13:37:49,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077311592] [2025-03-03 13:37:49,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:49,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2025-03-03 13:37:49,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:49,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2025-03-03 13:37:49,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2025-03-03 13:37:49,138 INFO L87 Difference]: Start difference. First operand 149 states and 152 transitions. Second operand has 129 states, 129 states have (on average 2.054263565891473) internal successors, (265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:49,412 INFO L93 Difference]: Finished difference Result 300 states and 370 transitions. [2025-03-03 13:37:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-03 13:37:49,412 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 129 states have (on average 2.054263565891473) internal successors, (265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-03 13:37:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:49,414 INFO L225 Difference]: With dead ends: 300 [2025-03-03 13:37:49,414 INFO L226 Difference]: Without dead ends: 277 [2025-03-03 13:37:49,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2025-03-03 13:37:49,418 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:49,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:37:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-03 13:37:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-03 13:37:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.0144927536231885) internal successors, (280), 276 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2025-03-03 13:37:49,436 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 148 [2025-03-03 13:37:49,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:49,436 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2025-03-03 13:37:49,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 2.054263565891473) internal successors, (265), 129 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2025-03-03 13:37:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 13:37:49,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:49,439 INFO L218 NwaCegarLoop]: trace histogram [128, 126, 14, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:49,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:37:49,639 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,SelfDestructingSolverStorable9 [2025-03-03 13:37:49,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:49,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 208558364, now seen corresponding path program 8 times [2025-03-03 13:37:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492684742] [2025-03-03 13:37:49,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:49,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 276 statements into 2 equivalence classes. [2025-03-03 13:37:49,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 13:37:49,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:49,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16489 backedges. 382 proven. 105 refuted. 0 times theorem prover too weak. 16002 trivial. 0 not checked. [2025-03-03 13:37:50,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492684742] [2025-03-03 13:37:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492684742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091138016] [2025-03-03 13:37:50,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:50,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:50,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:50,051 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-03 13:37:50,052 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-03 13:37:50,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 276 statements into 2 equivalence classes. [2025-03-03 13:37:50,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 13:37:50,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:50,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:50,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 254 conjuncts are in the unsatisfiable core [2025-03-03 13:37:50,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 16489 backedges. 381 proven. 16002 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 13:37:55,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:38:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16489 backedges. 381 proven. 16002 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 13:38:08,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091138016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:38:08,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:38:08,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 129, 129] total 271 [2025-03-03 13:38:08,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441181034] [2025-03-03 13:38:08,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:38:08,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 271 states [2025-03-03 13:38:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:38:08,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 271 interpolants. [2025-03-03 13:38:08,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32775, Invalid=40395, Unknown=0, NotChecked=0, Total=73170 [2025-03-03 13:38:08,346 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand has 271 states, 271 states have (on average 1.992619926199262) internal successors, (540), 271 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:38:27,776 INFO L93 Difference]: Finished difference Result 563 states and 701 transitions. [2025-03-03 13:38:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2025-03-03 13:38:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 271 states, 271 states have (on average 1.992619926199262) internal successors, (540), 271 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-03-03 13:38:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:38:27,778 INFO L225 Difference]: With dead ends: 563 [2025-03-03 13:38:27,778 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 13:38:27,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 523 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43864 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=101101, Invalid=173999, Unknown=0, NotChecked=0, Total=275100 [2025-03-03 13:38:27,786 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:38:27,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:38:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 13:38:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 534. [2025-03-03 13:38:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.0075046904315197) internal successors, (537), 533 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 537 transitions. [2025-03-03 13:38:27,831 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 537 transitions. Word has length 276 [2025-03-03 13:38:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:38:27,831 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 537 transitions. [2025-03-03 13:38:27,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 271 states, 271 states have (on average 1.992619926199262) internal successors, (540), 271 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 537 transitions. [2025-03-03 13:38:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-03 13:38:27,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:38:27,838 INFO L218 NwaCegarLoop]: trace histogram [256, 254, 15, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:38:27,845 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-03 13:38:28,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:28,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:38:28,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:38:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1284790120, now seen corresponding path program 9 times [2025-03-03 13:38:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:38:28,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928661027] [2025-03-03 13:38:28,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:38:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:38:28,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 533 statements into 257 equivalence classes. [2025-03-03 13:38:28,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 533 statements. [2025-03-03 13:38:28,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:38:28,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 65656 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64382 trivial. 0 not checked. [2025-03-03 13:38:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:38:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928661027] [2025-03-03 13:38:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928661027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:38:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100554741] [2025-03-03 13:38:28,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:38:28,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:28,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:38:28,122 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-03 13:38:28,124 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-03 13:38:28,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 533 statements into 257 equivalence classes. [2025-03-03 13:38:28,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 533 statements. [2025-03-03 13:38:28,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 13:38:28,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:28,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:38:28,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:38:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 65656 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64382 trivial. 0 not checked. [2025-03-03 13:38:28,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:38:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 65656 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64382 trivial. 0 not checked. [2025-03-03 13:38:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100554741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:38:28,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:38:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 13:38:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101471189] [2025-03-03 13:38:28,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:38:28,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:38:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:38:28,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:38:28,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:38:28,289 INFO L87 Difference]: Start difference. First operand 534 states and 537 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:38:28,333 INFO L93 Difference]: Finished difference Result 561 states and 572 transitions. [2025-03-03 13:38:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:38:28,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 533 [2025-03-03 13:38:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:38:28,337 INFO L225 Difference]: With dead ends: 561 [2025-03-03 13:38:28,337 INFO L226 Difference]: Without dead ends: 542 [2025-03-03 13:38:28,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1069 GetRequests, 1063 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:38:28,338 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:38:28,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:38:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-03 13:38:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-03 13:38:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.0147874306839186) internal successors, (549), 541 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 549 transitions. [2025-03-03 13:38:28,373 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 549 transitions. Word has length 533 [2025-03-03 13:38:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:38:28,374 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 549 transitions. [2025-03-03 13:38:28,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:38:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 549 transitions. [2025-03-03 13:38:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 13:38:28,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:38:28,380 INFO L218 NwaCegarLoop]: trace histogram [260, 254, 15, 6, 1, 1, 1, 1, 1, 1] [2025-03-03 13:38:28,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:38:28,581 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,SelfDestructingSolverStorable11 [2025-03-03 13:38:28,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:38:28,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:38:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 328311020, now seen corresponding path program 10 times [2025-03-03 13:38:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:38:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124067136] [2025-03-03 13:38:28,582 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:38:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:38:28,611 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 541 statements into 2 equivalence classes. [2025-03-03 13:38:28,635 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 13:38:28,635 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:38:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 67720 backedges. 2830 proven. 120 refuted. 0 times theorem prover too weak. 64770 trivial. 0 not checked. [2025-03-03 13:38:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:38:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124067136] [2025-03-03 13:38:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124067136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:38:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486454578] [2025-03-03 13:38:29,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:38:29,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:29,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:38:29,218 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-03 13:38:29,219 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-03 13:38:29,373 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 541 statements into 2 equivalence classes. [2025-03-03 13:38:29,526 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 13:38:29,526 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:38:29,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:29,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 510 conjuncts are in the unsatisfiable core [2025-03-03 13:38:29,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:38:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 67720 backedges. 2805 proven. 64770 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-03 13:38:48,010 INFO L312 TraceCheckSpWp]: Computing backward predicates...