./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.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_11.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 c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:37:39,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:37:39,376 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:39,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:37:39,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:37:39,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:37:39,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:37:39,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:37:39,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:37:39,402 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:37:39,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:37:39,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:37:39,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:37:39,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:37:39,403 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:37:39,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:37:39,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:37:39,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:37:39,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:37:39,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:37:39,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:37:39,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:37:39,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:37:39,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:37:39,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:37:39,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:37:39,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:37:39,406 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 -> c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 [2025-03-03 13:37:39,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:37:39,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:37:39,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:37:39,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:37:39,622 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:37:39,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2025-03-03 13:37:40,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09450773/e617f8a83e944623b8acdfa724730a7b/FLAG12d4426af [2025-03-03 13:37:40,930 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:37:40,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2025-03-03 13:37:40,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09450773/e617f8a83e944623b8acdfa724730a7b/FLAG12d4426af [2025-03-03 13:37:41,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b09450773/e617f8a83e944623b8acdfa724730a7b [2025-03-03 13:37:41,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:37:41,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:37:41,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:37:41,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:37:41,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:37:41,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:37:41" (1/1) ... [2025-03-03 13:37:41,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568aa3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:41, skipping insertion in model container [2025-03-03 13:37:41,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:37:41" (1/1) ... [2025-03-03 13:37:41,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:37:41,404 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_11.c[319,332] [2025-03-03 13:37:41,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:37:41,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:37:41,429 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_11.c[319,332] [2025-03-03 13:37:41,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:37:41,440 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:37:41,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:41 WrapperNode [2025-03-03 13:37:41,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:37:41,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:37:41,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:37:41,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:37:41,445 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:41" (1/1) ... [2025-03-03 13:37:41,448 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:41" (1/1) ... [2025-03-03 13:37:41,458 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24 [2025-03-03 13:37:41,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:37:41,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:37:41,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:37:41,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:37:41,464 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:41" (1/1) ... [2025-03-03 13:37:41,464 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:41" (1/1) ... [2025-03-03 13:37:41,464 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:41" (1/1) ... [2025-03-03 13:37:41,469 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:41,469 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:41" (1/1) ... [2025-03-03 13:37:41,469 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:41" (1/1) ... [2025-03-03 13:37:41,470 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:41" (1/1) ... [2025-03-03 13:37:41,471 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:41" (1/1) ... [2025-03-03 13:37:41,471 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:41" (1/1) ... [2025-03-03 13:37:41,471 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:41" (1/1) ... [2025-03-03 13:37:41,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:37:41,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:37:41,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:37:41,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:37:41,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:41" (1/1) ... [2025-03-03 13:37:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:37:41,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:41,494 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:41,496 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:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:37:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:37:41,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:37:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:37:41,546 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:37:41,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:37:41,625 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 13:37:41,625 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:37:41,633 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:37:41,633 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:37:41,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:37:41 BoogieIcfgContainer [2025-03-03 13:37:41,634 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:37:41,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:37:41,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:37:41,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:37:41,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:37:41" (1/3) ... [2025-03-03 13:37:41,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cc64cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:37:41, skipping insertion in model container [2025-03-03 13:37:41,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:37:41" (2/3) ... [2025-03-03 13:37:41,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22cc64cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:37:41, skipping insertion in model container [2025-03-03 13:37:41,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:37:41" (3/3) ... [2025-03-03 13:37:41,641 INFO L128 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2025-03-03 13:37:41,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:37:41,654 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mono-crafted_11.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:37:41,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:37:41,696 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;@74efbfdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:37:41,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:37:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) 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:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 13:37:41,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:41,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 13:37:41,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:41,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash 40045990, now seen corresponding path program 1 times [2025-03-03 13:37:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:41,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377857609] [2025-03-03 13:37:41,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:41,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 13:37:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 13:37:41,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:41,877 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:41,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377857609] [2025-03-03 13:37:41,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377857609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:37:41,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:37:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:37:41,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381241385] [2025-03-03 13:37:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:37:41,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:37:41,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:41,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:37:41,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:37:41,892 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:41,923 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-03 13:37:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:37:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 13:37:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:41,928 INFO L225 Difference]: With dead ends: 22 [2025-03-03 13:37:41,929 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 13:37:41,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:37:41,932 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:41,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 13:37:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 13:37:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-03 13:37:41,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2025-03-03 13:37:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:41,949 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-03 13:37:41,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:37:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-03-03 13:37:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 13:37:41,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:41,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:41,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:37:41,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -167646296, now seen corresponding path program 1 times [2025-03-03 13:37:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14277712] [2025-03-03 13:37:41,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:41,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:37:41,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:37:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14277712] [2025-03-03 13:37:42,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14277712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688859042] [2025-03-03 13:37:42,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:42,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:42,042 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:42,044 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:42,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:37:42,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:37:42,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:42,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:42,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:37:42,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:42,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688859042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:42,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:42,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 13:37:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540746871] [2025-03-03 13:37:42,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:42,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 13:37:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:42,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 13:37:42,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 13:37:42,138 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:42,187 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-03-03 13:37:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:37:42,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-03 13:37:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:42,188 INFO L225 Difference]: With dead ends: 18 [2025-03-03 13:37:42,188 INFO L226 Difference]: Without dead ends: 13 [2025-03-03 13:37:42,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:37:42,190 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:42,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-03 13:37:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-03 13:37:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-03-03 13:37:42,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2025-03-03 13:37:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:42,195 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-03-03 13:37:42,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-03-03 13:37:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 13:37:42,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:42,196 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:42,202 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:42,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:42,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:42,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1434594677, now seen corresponding path program 1 times [2025-03-03 13:37:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181830573] [2025-03-03 13:37:42,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:42,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:37:42,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:37:42,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181830573] [2025-03-03 13:37:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181830573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743944330] [2025-03-03 13:37:42,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:37:42,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:42,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:42,503 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:42,504 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:42,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:37:42,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:37:42,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:37:42,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:42,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:37:42,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:42,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743944330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:42,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 10 [2025-03-03 13:37:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133540771] [2025-03-03 13:37:42,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:42,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:37:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:42,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:37:42,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:37:42,646 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:42,705 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-03 13:37:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:37:42,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 13:37:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:42,707 INFO L225 Difference]: With dead ends: 24 [2025-03-03 13:37:42,707 INFO L226 Difference]: Without dead ends: 17 [2025-03-03 13:37:42,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:37:42,708 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:42,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-03 13:37:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-03-03 13:37:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-03 13:37:42,716 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2025-03-03 13:37:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:42,717 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-03 13:37:42,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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,717 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-03 13:37:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:37:42,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:42,717 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:42,723 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:42,922 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,SelfDestructingSolverStorable2 [2025-03-03 13:37:42,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash 13281037, now seen corresponding path program 2 times [2025-03-03 13:37:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211087253] [2025-03-03 13:37:42,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:42,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-03 13:37:42,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:37:42,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:42,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211087253] [2025-03-03 13:37:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211087253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436758854] [2025-03-03 13:37:43,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:37:43,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:43,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:43,039 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:43,041 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:43,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-03 13:37:43,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:37:43,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:37:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:43,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:37:43,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:43,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:37:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436758854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:43,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2025-03-03 13:37:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285568822] [2025-03-03 13:37:43,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:43,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:37:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:43,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:37:43,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:37:43,216 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:43,334 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-03-03 13:37:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:37:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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 13 [2025-03-03 13:37:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:43,335 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:37:43,335 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 13:37:43,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=123, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:37:43,336 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:43,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 13:37:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 13:37:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-03 13:37:43,342 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2025-03-03 13:37:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:43,342 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-03 13:37:43,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-03 13:37:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:37:43,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:43,343 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2025-03-03 13:37:43,348 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:43,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:43,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:43,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash -99680359, now seen corresponding path program 3 times [2025-03-03 13:37:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458099780] [2025-03-03 13:37:43,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:43,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-03-03 13:37:43,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 11 of 25 statements. [2025-03-03 13:37:43,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:37:43,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 13:37:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458099780] [2025-03-03 13:37:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458099780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523398229] [2025-03-03 13:37:43,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:37:43,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:43,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:43,648 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:43,650 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:43,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-03-03 13:37:43,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 11 of 25 statements. [2025-03-03 13:37:43,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:37:43,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:43,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:37:43,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 13:37:43,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 13:37:43,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523398229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:43,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:43,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-03 13:37:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990416313] [2025-03-03 13:37:43,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:43,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:37:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:43,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:37:43,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:37:43,750 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:43,809 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2025-03-03 13:37:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:37:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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) Word has length 25 [2025-03-03 13:37:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:43,811 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:37:43,811 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 13:37:43,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:37:43,811 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:43,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 20 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:37:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 13:37:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2025-03-03 13:37:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-03 13:37:43,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 25 [2025-03-03 13:37:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:43,817 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-03 13:37:43,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-03 13:37:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:37:43,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:43,818 INFO L218 NwaCegarLoop]: trace histogram [13, 9, 4, 1, 1, 1, 1, 1] [2025-03-03 13:37:43,827 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:44,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:44,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1406224316, now seen corresponding path program 4 times [2025-03-03 13:37:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271749018] [2025-03-03 13:37:44,022 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:37:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:44,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 13:37:44,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:37:44,033 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:37:44,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 70 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 13:37:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271749018] [2025-03-03 13:37:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271749018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647843140] [2025-03-03 13:37:44,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:37:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:44,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:44,210 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:44,212 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:44,234 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 13:37:44,245 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:37:44,245 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:37:44,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:44,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 13:37:44,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 55 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:44,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 55 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:37:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647843140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:44,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 26 [2025-03-03 13:37:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707076135] [2025-03-03 13:37:44,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:44,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 13:37:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:44,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 13:37:44,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:37:44,688 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 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:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:37:48,038 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2025-03-03 13:37:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 13:37:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 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 31 [2025-03-03 13:37:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:37:48,039 INFO L225 Difference]: With dead ends: 72 [2025-03-03 13:37:48,039 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 13:37:48,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=464, Invalid=796, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 13:37:48,040 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:37:48,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:37:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 13:37:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 13:37:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 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:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-03-03 13:37:48,055 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 31 [2025-03-03 13:37:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:37:48,055 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-03-03 13:37:48,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 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:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-03-03 13:37:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 13:37:48,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:37:48,057 INFO L218 NwaCegarLoop]: trace histogram [25, 21, 4, 1, 1, 1, 1, 1] [2025-03-03 13:37:48,063 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:48,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:48,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:37:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:37:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash -314249004, now seen corresponding path program 5 times [2025-03-03 13:37:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:37:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650603203] [2025-03-03 13:37:48,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:37:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:37:48,267 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 26 equivalence classes. [2025-03-03 13:37:48,323 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 13:37:48,324 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-03-03 13:37:48,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 13:37:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:37:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650603203] [2025-03-03 13:37:48,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650603203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:37:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378049450] [2025-03-03 13:37:48,756 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:37:48,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:37:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:37:48,759 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:48,761 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:48,782 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 26 equivalence classes. [2025-03-03 13:37:48,867 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 13:37:48,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2025-03-03 13:37:48,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:37:48,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 13:37:48,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:37:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 13:37:48,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:37:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 13:37:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378049450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:37:49,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:37:49,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 48 [2025-03-03 13:37:49,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59357016] [2025-03-03 13:37:49,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:37:49,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 13:37:49,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:37:49,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 13:37:49,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=1611, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:37:49,867 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 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:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:38:44,048 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2025-03-03 13:38:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-03 13:38:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 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 55 [2025-03-03 13:38:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:38:44,052 INFO L225 Difference]: With dead ends: 118 [2025-03-03 13:38:44,053 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 13:38:44,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=1653, Invalid=3039, Unknown=0, NotChecked=0, Total=4692 [2025-03-03 13:38:44,057 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:38:44,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:38:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 13:38:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-03 13:38:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.058252427184466) internal successors, (109), 103 states have internal predecessors, (109), 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:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2025-03-03 13:38:44,070 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 55 [2025-03-03 13:38:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:38:44,070 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2025-03-03 13:38:44,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 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:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2025-03-03 13:38:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 13:38:44,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:38:44,072 INFO L218 NwaCegarLoop]: trace histogram [49, 45, 4, 1, 1, 1, 1, 1] [2025-03-03 13:38:44,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 13:38:44,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:44,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:38:44,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:38:44,274 INFO L85 PathProgramCache]: Analyzing trace with hash -132584700, now seen corresponding path program 6 times [2025-03-03 13:38:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:38:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434078945] [2025-03-03 13:38:44,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:38:44,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:38:44,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 50 equivalence classes. [2025-03-03 13:38:44,298 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 41 of 103 statements. [2025-03-03 13:38:44,299 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2025-03-03 13:38:44,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 405 proven. 16 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2025-03-03 13:38:44,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:38:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434078945] [2025-03-03 13:38:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434078945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:38:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334900213] [2025-03-03 13:38:44,521 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:38:44,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:44,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:38:44,523 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:38:44,524 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:38:44,549 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 103 statements into 50 equivalence classes. [2025-03-03 13:38:44,598 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) and asserted 41 of 103 statements. [2025-03-03 13:38:44,598 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2025-03-03 13:38:44,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:44,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:38:44,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:38:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 405 proven. 16 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2025-03-03 13:38:44,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:38:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 405 proven. 16 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2025-03-03 13:38:44,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334900213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:38:44,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:38:44,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-03-03 13:38:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572425519] [2025-03-03 13:38:44,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:38:44,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 13:38:44,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:38:44,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 13:38:44,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:38:44,768 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:38:45,064 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2025-03-03 13:38:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 13:38:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 103 [2025-03-03 13:38:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:38:45,065 INFO L225 Difference]: With dead ends: 153 [2025-03-03 13:38:45,065 INFO L226 Difference]: Without dead ends: 139 [2025-03-03 13:38:45,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:38:45,066 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:38:45,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:38:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-03 13:38:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2025-03-03 13:38:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.08130081300813) internal successors, (133), 123 states have internal predecessors, (133), 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:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2025-03-03 13:38:45,091 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 103 [2025-03-03 13:38:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:38:45,091 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2025-03-03 13:38:45,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2025-03-03 13:38:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 13:38:45,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:38:45,092 INFO L218 NwaCegarLoop]: trace histogram [55, 45, 10, 1, 1, 1, 1, 1] [2025-03-03 13:38:45,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 13:38:45,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:45,293 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:38:45,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:38:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash 8178826, now seen corresponding path program 7 times [2025-03-03 13:38:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:38:45,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106310787] [2025-03-03 13:38:45,294 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:38:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:38:45,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 13:38:45,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 13:38:45,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:38:45,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 874 proven. 2070 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 13:38:46,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:38:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106310787] [2025-03-03 13:38:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106310787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:38:46,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288348549] [2025-03-03 13:38:46,618 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 13:38:46,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:38:46,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:38:46,620 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:38:46,621 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:38:46,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 13:38:46,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 13:38:46,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:38:46,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:38:46,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-03 13:38:46,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:38:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 637 proven. 2352 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 13:38:46,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:38:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 637 proven. 2352 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 13:38:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288348549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:38:50,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:38:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 51, 52] total 102 [2025-03-03 13:38:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898273286] [2025-03-03 13:38:50,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:38:50,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2025-03-03 13:38:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:38:50,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2025-03-03 13:38:50,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2748, Invalid=7554, Unknown=0, NotChecked=0, Total=10302 [2025-03-03 13:38:50,334 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand has 102 states, 102 states have (on average 2.0294117647058822) internal successors, (207), 102 states have internal predecessors, (207), 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)