./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_8.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 e1972ee33272415a52c6f0d8a1f799e9d488ad771872c0cf36a214b07ea597fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:56:09,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:56:09,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:56:09,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:56:09,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:56:09,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:56:09,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:56:09,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:56:09,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:56:09,818 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:56:09,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:56:09,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:56:09,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:56:09,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:56:09,819 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:56:09,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:56:09,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:56:09,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:56:09,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:56:09,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:56:09,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:56:09,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:56:09,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:56:09,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:56:09,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:56:09,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:56:09,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:56:09,822 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 -> e1972ee33272415a52c6f0d8a1f799e9d488ad771872c0cf36a214b07ea597fd [2025-03-16 17:56:10,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:56:10,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:56:10,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:56:10,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:56:10,072 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:56:10,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2025-03-16 17:56:11,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76730f46b/0d464fc136ee4d8b9c685c2c559205df/FLAGaebab8569 [2025-03-16 17:56:11,410 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:56:11,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_8.c [2025-03-16 17:56:11,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76730f46b/0d464fc136ee4d8b9c685c2c559205df/FLAGaebab8569 [2025-03-16 17:56:11,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76730f46b/0d464fc136ee4d8b9c685c2c559205df [2025-03-16 17:56:11,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:56:11,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:56:11,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:56:11,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:56:11,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:56:11,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575fa61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11, skipping insertion in model container [2025-03-16 17:56:11,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:56:11,595 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_8.c[318,331] [2025-03-16 17:56:11,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:56:11,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:56:11,620 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_8.c[318,331] [2025-03-16 17:56:11,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:56:11,634 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:56:11,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11 WrapperNode [2025-03-16 17:56:11,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:56:11,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:56:11,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:56:11,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:56:11,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,656 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-16 17:56:11,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:56:11,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:56:11,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:56:11,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:56:11,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,671 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-16 17:56:11,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:56:11,682 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:56:11,683 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:56:11,683 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:56:11,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (1/1) ... [2025-03-16 17:56:11,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:56:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:11,710 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-16 17:56:11,713 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-16 17:56:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:56:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:56:11,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:56:11,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:56:11,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:56:11,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:56:11,850 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-16 17:56:11,850 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:56:11,855 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:56:11,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:56:11,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:56:11 BoogieIcfgContainer [2025-03-16 17:56:11,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:56:11,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:56:11,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:56:11,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:56:11,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:56:11" (1/3) ... [2025-03-16 17:56:11,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206f9363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:56:11, skipping insertion in model container [2025-03-16 17:56:11,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:56:11" (2/3) ... [2025-03-16 17:56:11,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206f9363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:56:11, skipping insertion in model container [2025-03-16 17:56:11,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:56:11" (3/3) ... [2025-03-16 17:56:11,863 INFO L128 eAbstractionObserver]: Analyzing ICFG mono-crafted_8.c [2025-03-16 17:56:11,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:56:11,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mono-crafted_8.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 17:56:11,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:56:11,922 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;@516a2479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:56:11,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:56:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 17:56:11,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:11,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 17:56:11,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:11,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1226331, now seen corresponding path program 1 times [2025-03-16 17:56:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181300159] [2025-03-16 17:56:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:56:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:11,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 17:56:12,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 17:56:12,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:56:12,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:12,130 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-16 17:56:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:12,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181300159] [2025-03-16 17:56:12,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181300159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:56:12,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:56:12,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:56:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446517253] [2025-03-16 17:56:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:56:12,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:56:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:12,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:56:12,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:56:12,149 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 17:56:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:12,171 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-16 17:56:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:56:12,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-16 17:56:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:12,178 INFO L225 Difference]: With dead ends: 22 [2025-03-16 17:56:12,178 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 17:56:12,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:56:12,181 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:12,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 17:56:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-16 17:56:12,197 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-16 17:56:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-03-16 17:56:12,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2025-03-16 17:56:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:12,200 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-03-16 17:56:12,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 17:56:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-03-16 17:56:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:56:12,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:12,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:56:12,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:56:12,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:12,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2001820570, now seen corresponding path program 1 times [2025-03-16 17:56:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:12,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240774052] [2025-03-16 17:56:12,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:56:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:12,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:56:12,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:56:12,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:56:12,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:12,381 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-16 17:56:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240774052] [2025-03-16 17:56:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240774052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643588014] [2025-03-16 17:56:12,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:56:12,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:12,385 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-16 17:56:12,387 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-16 17:56:12,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:56:12,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:56:12,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:56:12,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:12,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:56:12,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:12,474 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-16 17:56:12,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:12,538 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-16 17:56:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643588014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:12,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:12,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 8 [2025-03-16 17:56:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885561142] [2025-03-16 17:56:12,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:12,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:56:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:12,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:56:12,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:56:12,540 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:12,624 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-03-16 17:56:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:56:12,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 17:56:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:12,625 INFO L225 Difference]: With dead ends: 23 [2025-03-16 17:56:12,625 INFO L226 Difference]: Without dead ends: 17 [2025-03-16 17:56:12,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:56:12,626 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:12,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-16 17:56:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-16 17:56:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-16 17:56:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-16 17:56:12,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 7 [2025-03-16 17:56:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:12,632 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-16 17:56:12,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-16 17:56:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 17:56:12,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:12,633 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1] [2025-03-16 17:56:12,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:56:12,838 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-16 17:56:12,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:12,838 INFO L85 PathProgramCache]: Analyzing trace with hash -270050757, now seen corresponding path program 1 times [2025-03-16 17:56:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527001322] [2025-03-16 17:56:12,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:56:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:12,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 17:56:12,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:56:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:56:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:56:12,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:12,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527001322] [2025-03-16 17:56:12,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527001322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:12,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511812354] [2025-03-16 17:56:12,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:56:12,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:12,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:12,963 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-16 17:56:12,964 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-16 17:56:12,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 17:56:12,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:56:12,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:56:12,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:12,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:56:12,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:56:13,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:56:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511812354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:13,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:13,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 9 [2025-03-16 17:56:13,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341922506] [2025-03-16 17:56:13,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:13,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:56:13,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:13,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:56:13,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:56:13,117 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:13,197 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-16 17:56:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:56:13,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-16 17:56:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:13,199 INFO L225 Difference]: With dead ends: 33 [2025-03-16 17:56:13,199 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 17:56:13,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:56:13,200 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:13,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 17:56:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-16 17:56:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-16 17:56:13,204 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 16 [2025-03-16 17:56:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:13,205 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-16 17:56:13,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-03-16 17:56:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 17:56:13,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:13,205 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2025-03-16 17:56:13,211 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-16 17:56:13,409 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-16 17:56:13,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:13,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1473683099, now seen corresponding path program 2 times [2025-03-16 17:56:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352025556] [2025-03-16 17:56:13,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:56:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:13,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-16 17:56:13,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:56:13,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:56:13,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:56:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352025556] [2025-03-16 17:56:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352025556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967590116] [2025-03-16 17:56:13,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:56:13,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:13,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:13,582 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-16 17:56:13,584 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-16 17:56:13,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-16 17:56:13,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 17:56:13,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:56:13,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:13,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 17:56:13,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:56:13,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:56:13,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967590116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:13,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-16 17:56:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267924099] [2025-03-16 17:56:13,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:13,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 17:56:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:13,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 17:56:13,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:56:13,809 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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-16 17:56:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:14,071 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2025-03-16 17:56:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 17:56:14,072 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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 16 [2025-03-16 17:56:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:14,072 INFO L225 Difference]: With dead ends: 38 [2025-03-16 17:56:14,072 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 17:56:14,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2025-03-16 17:56:14,073 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:14,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 16 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:56:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 17:56:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-16 17:56:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-16 17:56:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-16 17:56:14,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 16 [2025-03-16 17:56:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:14,078 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-16 17:56:14,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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-16 17:56:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-16 17:56:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:56:14,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:14,079 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1] [2025-03-16 17:56:14,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 17:56:14,283 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-16 17:56:14,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -55687621, now seen corresponding path program 2 times [2025-03-16 17:56:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138712055] [2025-03-16 17:56:14,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:56:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:14,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-16 17:56:14,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:56:14,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:56:14,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 17:56:14,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138712055] [2025-03-16 17:56:14,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138712055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:14,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635501478] [2025-03-16 17:56:14,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:56:14,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:14,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:14,434 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-16 17:56:14,436 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-16 17:56:14,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-16 17:56:14,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:56:14,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:56:14,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:14,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 17:56:14,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 17:56:14,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 17:56:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635501478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:14,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-16 17:56:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156695853] [2025-03-16 17:56:14,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:14,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 17:56:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:14,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 17:56:14,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-16 17:56:14,631 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 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-16 17:56:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:14,994 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2025-03-16 17:56:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:56:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 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 34 [2025-03-16 17:56:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:14,995 INFO L225 Difference]: With dead ends: 63 [2025-03-16 17:56:14,995 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 17:56:14,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2025-03-16 17:56:14,996 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:14,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:56:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 17:56:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-03-16 17:56:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 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-16 17:56:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-16 17:56:15,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 34 [2025-03-16 17:56:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:15,002 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-16 17:56:15,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 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-16 17:56:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-16 17:56:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:56:15,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:15,002 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1] [2025-03-16 17:56:15,008 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-16 17:56:15,203 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-16 17:56:15,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:15,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash -614463749, now seen corresponding path program 3 times [2025-03-16 17:56:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:15,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961743438] [2025-03-16 17:56:15,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:15,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 11 equivalence classes. [2025-03-16 17:56:15,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 34 statements. [2025-03-16 17:56:15,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 17:56:15,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-16 17:56:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961743438] [2025-03-16 17:56:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961743438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332555424] [2025-03-16 17:56:15,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:15,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:15,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:15,277 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-16 17:56:15,279 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-16 17:56:15,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 11 equivalence classes. [2025-03-16 17:56:15,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 7 of 34 statements. [2025-03-16 17:56:15,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-16 17:56:15,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:15,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 17:56:15,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-16 17:56:15,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:56:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332555424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:56:15,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:56:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 17:56:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145843605] [2025-03-16 17:56:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:56:15,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:56:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:15,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:56:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:56:15,359 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-16 17:56:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:15,391 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2025-03-16 17:56:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:56:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 34 [2025-03-16 17:56:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:15,392 INFO L225 Difference]: With dead ends: 56 [2025-03-16 17:56:15,392 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 17:56:15,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:56:15,393 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:15,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 17:56:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-03-16 17:56:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 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-16 17:56:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2025-03-16 17:56:15,404 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 34 [2025-03-16 17:56:15,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:15,404 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2025-03-16 17:56:15,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-16 17:56:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2025-03-16 17:56:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 17:56:15,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:15,405 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1] [2025-03-16 17:56:15,411 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-16 17:56:15,610 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-16 17:56:15,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:15,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash -249292795, now seen corresponding path program 3 times [2025-03-16 17:56:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272982243] [2025-03-16 17:56:15,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:15,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:15,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 16 equivalence classes. [2025-03-16 17:56:15,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 49 statements. [2025-03-16 17:56:15,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:56:15,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-16 17:56:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272982243] [2025-03-16 17:56:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272982243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:15,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868510243] [2025-03-16 17:56:15,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:15,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:15,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:15,822 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-16 17:56:15,823 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-16 17:56:15,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 16 equivalence classes. [2025-03-16 17:56:15,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 49 statements. [2025-03-16 17:56:15,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:56:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:15,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 17:56:15,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-16 17:56:15,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-16 17:56:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868510243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:16,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:16,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2025-03-16 17:56:16,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292855415] [2025-03-16 17:56:16,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:16,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 17:56:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:16,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 17:56:16,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-16 17:56:16,255 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 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-16 17:56:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:16,375 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-03-16 17:56:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:56:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 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 49 [2025-03-16 17:56:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:16,376 INFO L225 Difference]: With dead ends: 71 [2025-03-16 17:56:16,376 INFO L226 Difference]: Without dead ends: 63 [2025-03-16 17:56:16,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-03-16 17:56:16,377 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:16,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:56:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-16 17:56:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-16 17:56:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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-16 17:56:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-16 17:56:16,383 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 49 [2025-03-16 17:56:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:16,383 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-16 17:56:16,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 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-16 17:56:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-16 17:56:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 17:56:16,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:16,384 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 14, 5, 1, 1, 1, 1] [2025-03-16 17:56:16,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 17:56:16,589 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-16 17:56:16,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:16,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:16,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1630474373, now seen corresponding path program 4 times [2025-03-16 17:56:16,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:16,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48571874] [2025-03-16 17:56:16,589 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:56:16,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:16,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-03-16 17:56:16,612 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 17:56:16,612 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:56:16,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 301 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 17:56:16,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:16,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48571874] [2025-03-16 17:56:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48571874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352576277] [2025-03-16 17:56:16,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:56:16,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:16,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:16,940 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-16 17:56:16,941 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-16 17:56:16,967 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 61 statements into 2 equivalence classes. [2025-03-16 17:56:16,983 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 17:56:16,983 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:56:16,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:16,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 17:56:16,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 301 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 17:56:17,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 205 proven. 301 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 17:56:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352576277] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:17,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 33 [2025-03-16 17:56:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701964320] [2025-03-16 17:56:17,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:17,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-16 17:56:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:17,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-16 17:56:17,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 17:56:17,668 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 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-16 17:56:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:27,219 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2025-03-16 17:56:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 17:56:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 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 61 [2025-03-16 17:56:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:27,221 INFO L225 Difference]: With dead ends: 130 [2025-03-16 17:56:27,221 INFO L226 Difference]: Without dead ends: 110 [2025-03-16 17:56:27,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=813, Invalid=1443, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 17:56:27,222 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:27,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:56:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-16 17:56:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-16 17:56:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 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-16 17:56:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-16 17:56:27,233 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 61 [2025-03-16 17:56:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:27,233 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-16 17:56:27,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 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-16 17:56:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-16 17:56:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 17:56:27,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:27,234 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 30, 5, 1, 1, 1, 1] [2025-03-16 17:56:27,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 17:56:27,435 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-16 17:56:27,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:27,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash 501272453, now seen corresponding path program 5 times [2025-03-16 17:56:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179140571] [2025-03-16 17:56:27,436 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:56:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:27,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 109 statements into 36 equivalence classes. [2025-03-16 17:56:27,509 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 17:56:27,509 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2025-03-16 17:56:27,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 294 proven. 1517 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:56:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179140571] [2025-03-16 17:56:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179140571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122608178] [2025-03-16 17:56:28,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:56:28,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:28,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:28,582 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-16 17:56:28,583 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-16 17:56:28,611 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 109 statements into 36 equivalence classes. [2025-03-16 17:56:28,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 17:56:28,828 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2025-03-16 17:56:28,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:28,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-16 17:56:28,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 168 proven. 1650 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:56:29,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 168 proven. 1650 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:56:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122608178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:30,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 75 [2025-03-16 17:56:30,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509267320] [2025-03-16 17:56:30,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:30,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-16 17:56:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-16 17:56:30,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=4235, Unknown=0, NotChecked=0, Total=5700 [2025-03-16 17:56:30,429 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 76 states, 76 states have (on average 2.9078947368421053) internal successors, (221), 75 states have internal predecessors, (221), 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-16 17:56:41,711 WARN L286 SmtUtils]: Spent 9.98s on a formula simplification. DAG size of input: 138 DAG size of output: 10 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 17:56:51,006 WARN L286 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 134 DAG size of output: 10 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 17:57:04,820 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 130 DAG size of output: 10 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)