./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.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 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:59:48,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:59:48,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:59:48,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:59:48,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:59:48,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:59:48,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:59:48,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:59:48,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:59:48,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:59:48,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:59:48,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:59:48,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:59:48,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:59:48,985 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:59:48,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:59:48,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:59:48,985 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:59:48,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:59:48,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:59:48,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:59:48,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:59:48,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:59:48,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:59:48,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:59:48,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:59:48,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:59:48,987 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:59:48,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:59:48,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:59:48,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:59:48,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:59:48,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:59:48,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:59:48,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:59:48,988 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 -> 0bb6780cd72c063a3ddf598e6503fa6a629155476e6b8e08224a0e59d0bc00b9 [2025-03-03 13:59:49,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:59:49,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:59:49,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:59:49,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:59:49,193 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:59:49,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2025-03-03 13:59:50,287 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01763148/68aa341ee5e744f2b1397003bc91b189/FLAG83f50fd22 [2025-03-03 13:59:50,516 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:59:50,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2025-03-03 13:59:50,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01763148/68aa341ee5e744f2b1397003bc91b189/FLAG83f50fd22 [2025-03-03 13:59:50,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01763148/68aa341ee5e744f2b1397003bc91b189 [2025-03-03 13:59:50,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:59:50,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:59:50,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:59:50,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:59:50,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:59:50,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c603cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50, skipping insertion in model container [2025-03-03 13:59:50,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:59:50,663 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/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2025-03-03 13:59:50,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:59:50,686 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:59:50,693 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/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2025-03-03 13:59:50,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:59:50,708 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:59:50,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50 WrapperNode [2025-03-03 13:59:50,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:59:50,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:59:50,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:59:50,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:59:50,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,731 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2025-03-03 13:59:50,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:59:50,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:59:50,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:59:50,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:59:50,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,748 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:59:50,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:59:50,753 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:59:50,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:59:50,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:59:50,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (1/1) ... [2025-03-03 13:59:50,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:59:50,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:50,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:59:50,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:59:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:59:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 13:59:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 13:59:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:59:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:59:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:59:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:59:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:59:50,829 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:59:50,831 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:59:50,934 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 13:59:50,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:59:50,943 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:59:50,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:59:50,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:59:50 BoogieIcfgContainer [2025-03-03 13:59:50,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:59:50,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:59:50,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:59:50,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:59:50,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:59:50" (1/3) ... [2025-03-03 13:59:50,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d57dd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:59:50, skipping insertion in model container [2025-03-03 13:59:50,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:59:50" (2/3) ... [2025-03-03 13:59:50,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d57dd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:59:50, skipping insertion in model container [2025-03-03 13:59:50,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:59:50" (3/3) ... [2025-03-03 13:59:50,950 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2025-03-03 13:59:50,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:59:50,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_valuebound1.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:59:51,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:59:51,015 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;@8d5d83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:59:51,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:59:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:59:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:59:51,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:51,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:51,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1866426684, now seen corresponding path program 1 times [2025-03-03 13:59:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:51,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146602352] [2025-03-03 13:59:51,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:51,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:59:51,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:59:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:59:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:51,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146602352] [2025-03-03 13:59:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146602352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:59:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568850945] [2025-03-03 13:59:51,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:51,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:51,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:51,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:51,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:59:51,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:59:51,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:59:51,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:51,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:59:51,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:59:51,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:59:51,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568850945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:59:51,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:59:51,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:59:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478924154] [2025-03-03 13:59:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:59:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:51,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:59:51,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:59:51,208 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:59:51,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:51,219 INFO L93 Difference]: Finished difference Result 59 states and 96 transitions. [2025-03-03 13:59:51,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:59:51,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-03 13:59:51,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:51,223 INFO L225 Difference]: With dead ends: 59 [2025-03-03 13:59:51,223 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 13:59:51,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:59:51,227 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:51,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 13:59:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-03 13:59:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 13:59:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2025-03-03 13:59:51,247 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 23 [2025-03-03 13:59:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2025-03-03 13:59:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:59:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2025-03-03 13:59:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:59:51,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:51,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:51,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:59:51,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 13:59:51,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:51,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1261491227, now seen corresponding path program 1 times [2025-03-03 13:59:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011551652] [2025-03-03 13:59:51,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:51,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:51,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:59:51,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:59:51,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:51,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:59:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:51,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011551652] [2025-03-03 13:59:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011551652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:59:51,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:59:51,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:59:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234556970] [2025-03-03 13:59:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:51,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:51,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:51,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:59:51,621 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 13:59:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:51,677 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2025-03-03 13:59:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:59:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-03 13:59:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:51,678 INFO L225 Difference]: With dead ends: 39 [2025-03-03 13:59:51,678 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 13:59:51,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:59:51,679 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:51,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 13:59:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2025-03-03 13:59:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 13:59:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-03-03 13:59:51,685 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 23 [2025-03-03 13:59:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:51,686 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-03-03 13:59:51,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 13:59:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-03-03 13:59:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 13:59:51,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:51,686 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:51,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:59:51,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:51,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:51,687 INFO L85 PathProgramCache]: Analyzing trace with hash 443892832, now seen corresponding path program 1 times [2025-03-03 13:59:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348440836] [2025-03-03 13:59:51,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:51,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:51,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 13:59:51,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 13:59:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:51,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:59:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348440836] [2025-03-03 13:59:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348440836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:59:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:59:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:59:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235853948] [2025-03-03 13:59:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:51,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:51,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:51,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:59:51,806 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:59:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:51,853 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-03-03 13:59:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:59:51,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-03 13:59:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:51,856 INFO L225 Difference]: With dead ends: 43 [2025-03-03 13:59:51,857 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 13:59:51,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:59:51,860 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:51,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 13:59:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-03-03 13:59:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 13:59:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-03 13:59:51,865 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 28 [2025-03-03 13:59:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:51,865 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-03 13:59:51,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 13:59:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-03 13:59:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 13:59:51,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:51,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:51,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:59:51,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:51,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash 312813829, now seen corresponding path program 1 times [2025-03-03 13:59:51,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:51,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187172008] [2025-03-03 13:59:51,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:51,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:51,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:59:51,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:59:51,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:51,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:59:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939778770] [2025-03-03 13:59:51,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:51,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:51,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:51,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:51,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:59:51,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 13:59:51,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 13:59:51,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:51,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:51,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:59:51,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:59:52,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:59:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187172008] [2025-03-03 13:59:52,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:59:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939778770] [2025-03-03 13:59:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939778770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:59:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:59:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:59:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557890396] [2025-03-03 13:59:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:52,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:52,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:52,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:52,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:59:52,005 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:59:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:52,050 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2025-03-03 13:59:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:59:52,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2025-03-03 13:59:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:52,051 INFO L225 Difference]: With dead ends: 58 [2025-03-03 13:59:52,051 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 13:59:52,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:59:52,052 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:52,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 13:59:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 13:59:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 13:59:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2025-03-03 13:59:52,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 33 [2025-03-03 13:59:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:52,058 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2025-03-03 13:59:52,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 13:59:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2025-03-03 13:59:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:59:52,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:52,059 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:52,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:59:52,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 13:59:52,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash 987889245, now seen corresponding path program 1 times [2025-03-03 13:59:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939065459] [2025-03-03 13:59:52,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:52,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:59:52,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:59:52,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:52,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:59:52,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521793427] [2025-03-03 13:59:52,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:52,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:52,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:52,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:52,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:59:52,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:59:52,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:59:52,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:52,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:52,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:59:52,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 13:59:52,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:59:52,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:52,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939065459] [2025-03-03 13:59:52,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:59:52,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521793427] [2025-03-03 13:59:52,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521793427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:59:52,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:59:52,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:59:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851708475] [2025-03-03 13:59:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:52,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:52,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:52,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:59:52,402 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:59:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:52,467 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-03-03 13:59:52,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:59:52,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2025-03-03 13:59:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:52,468 INFO L225 Difference]: With dead ends: 58 [2025-03-03 13:59:52,468 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 13:59:52,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:59:52,468 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:52,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:52,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 13:59:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2025-03-03 13:59:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 13:59:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2025-03-03 13:59:52,475 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 39 [2025-03-03 13:59:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:52,475 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2025-03-03 13:59:52,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:59:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2025-03-03 13:59:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 13:59:52,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:52,476 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:52,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:59:52,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:52,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 251057081, now seen corresponding path program 1 times [2025-03-03 13:59:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92261208] [2025-03-03 13:59:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:52,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 13:59:52,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 13:59:52,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:52,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:59:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1279620834] [2025-03-03 13:59:52,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:52,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:52,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:52,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:52,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:59:52,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 13:59:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 13:59:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:52,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 13:59:52,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 13:59:52,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:59:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 13:59:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92261208] [2025-03-03 13:59:52,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:59:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279620834] [2025-03-03 13:59:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279620834] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 13:59:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:59:52,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-03 13:59:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155759676] [2025-03-03 13:59:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:52,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:52,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:52,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:59:52,991 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:59:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:53,055 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2025-03-03 13:59:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:59:53,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2025-03-03 13:59:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:53,057 INFO L225 Difference]: With dead ends: 64 [2025-03-03 13:59:53,057 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 13:59:53,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:59:53,057 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:53,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 13:59:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-03-03 13:59:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 36 states have internal predecessors, (40), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 13:59:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-03-03 13:59:53,072 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 49 [2025-03-03 13:59:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:53,072 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-03-03 13:59:53,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 13:59:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-03-03 13:59:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 13:59:53,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:53,073 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:53,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:59:53,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:53,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:53,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1226234172, now seen corresponding path program 1 times [2025-03-03 13:59:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065741965] [2025-03-03 13:59:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:53,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 13:59:53,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 13:59:53,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:53,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 13:59:53,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:53,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065741965] [2025-03-03 13:59:53,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065741965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:59:53,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:59:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:59:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943715419] [2025-03-03 13:59:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:53,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:53,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:53,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:53,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:59:53,392 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 13:59:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:53,429 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2025-03-03 13:59:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:59:53,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2025-03-03 13:59:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:53,430 INFO L225 Difference]: With dead ends: 69 [2025-03-03 13:59:53,430 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 13:59:53,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:59:53,431 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:53,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 13:59:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 13:59:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 13:59:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2025-03-03 13:59:53,439 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 55 [2025-03-03 13:59:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:53,439 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2025-03-03 13:59:53,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 13:59:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2025-03-03 13:59:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 13:59:53,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:53,440 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:53,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:59:53,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1056327704, now seen corresponding path program 1 times [2025-03-03 13:59:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560978938] [2025-03-03 13:59:53,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:53,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:53,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 13:59:53,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 13:59:53,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:53,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:59:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157605462] [2025-03-03 13:59:53,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:53,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:53,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:53,474 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:53,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:59:53,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 13:59:53,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 13:59:53,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:53,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 13:59:53,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 13:59:53,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:59:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 13:59:55,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:55,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560978938] [2025-03-03 13:59:55,326 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:59:55,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157605462] [2025-03-03 13:59:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157605462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:59:55,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:59:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-03-03 13:59:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004800592] [2025-03-03 13:59:55,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:59:55,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 13:59:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:55,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 13:59:55,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:59:55,327 INFO L87 Difference]: Start difference. First operand 58 states and 73 transitions. Second operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-03 13:59:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:55,725 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2025-03-03 13:59:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:59:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) Word has length 67 [2025-03-03 13:59:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:55,727 INFO L225 Difference]: With dead ends: 109 [2025-03-03 13:59:55,728 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 13:59:55,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:59:55,728 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:55,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 248 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:59:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 13:59:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2025-03-03 13:59:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 13:59:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2025-03-03 13:59:55,742 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 67 [2025-03-03 13:59:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:55,742 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2025-03-03 13:59:55,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 states have internal predecessors, (27), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-03 13:59:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2025-03-03 13:59:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 13:59:55,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:55,743 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:55,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:59:55,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:55,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:55,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash 663166422, now seen corresponding path program 1 times [2025-03-03 13:59:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:55,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042767247] [2025-03-03 13:59:55,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:55,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 13:59:55,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 13:59:55,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:55,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:59:55,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361352293] [2025-03-03 13:59:55,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:55,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:55,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:55,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:59:55,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 13:59:56,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 13:59:56,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:56,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:56,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 13:59:56,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-03 13:59:56,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:59:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-03 13:59:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042767247] [2025-03-03 13:59:56,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:59:56,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361352293] [2025-03-03 13:59:56,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361352293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:59:56,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:59:56,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2025-03-03 13:59:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904446016] [2025-03-03 13:59:56,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:59:56,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 13:59:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:56,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 13:59:56,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-03 13:59:56,726 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-03 13:59:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:57,463 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2025-03-03 13:59:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 13:59:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) Word has length 78 [2025-03-03 13:59:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:57,466 INFO L225 Difference]: With dead ends: 118 [2025-03-03 13:59:57,466 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 13:59:57,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 13:59:57,467 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:57,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 384 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:59:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 13:59:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2025-03-03 13:59:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 29 states have call successors, (29), 12 states have call predecessors, (29), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 13:59:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2025-03-03 13:59:57,490 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 78 [2025-03-03 13:59:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:57,490 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2025-03-03 13:59:57,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-03 13:59:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2025-03-03 13:59:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 13:59:57,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:57,494 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:57,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:59:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:57,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2072974892, now seen corresponding path program 1 times [2025-03-03 13:59:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733617732] [2025-03-03 13:59:57,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:57,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 13:59:57,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:59:57,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:57,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 13:59:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733617732] [2025-03-03 13:59:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733617732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:59:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118474182] [2025-03-03 13:59:57,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:59:57,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:57,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:57,767 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:57,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:59:57,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 13:59:57,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:59:57,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:59:57,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:57,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:59:57,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 13:59:57,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:59:57,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118474182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:59:57,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:59:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-03 13:59:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243168097] [2025-03-03 13:59:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:59:57,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:57,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:57,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:57,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:59:57,828 INFO L87 Difference]: Start difference. First operand 97 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-03 13:59:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:57,872 INFO L93 Difference]: Finished difference Result 117 states and 150 transitions. [2025-03-03 13:59:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:59:57,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 87 [2025-03-03 13:59:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:57,874 INFO L225 Difference]: With dead ends: 117 [2025-03-03 13:59:57,875 INFO L226 Difference]: Without dead ends: 105 [2025-03-03 13:59:57,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:59:57,875 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:57,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 117 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-03 13:59:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-03 13:59:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 13:59:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2025-03-03 13:59:57,894 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 87 [2025-03-03 13:59:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:57,895 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2025-03-03 13:59:57,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-03 13:59:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2025-03-03 13:59:57,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 13:59:57,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:57,897 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:57,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 13:59:58,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:58,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:58,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:58,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1511483873, now seen corresponding path program 2 times [2025-03-03 13:59:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:58,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611965853] [2025-03-03 13:59:58,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:59:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:58,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-03 13:59:58,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 13:59:58,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:59:58,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 13:59:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611965853] [2025-03-03 13:59:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611965853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:59:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113529812] [2025-03-03 13:59:58,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:59:58,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:58,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:58,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:59:58,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 90 statements into 2 equivalence classes. [2025-03-03 13:59:58,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 13:59:58,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:59:58,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:58,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:59:58,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-03 13:59:58,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:59:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 13:59:58,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113529812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:59:58,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:59:58,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-03 13:59:58,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528503281] [2025-03-03 13:59:58,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:59:58,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:59:58,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:58,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:59:58,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:59:58,374 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2025-03-03 13:59:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:58,411 INFO L93 Difference]: Finished difference Result 129 states and 166 transitions. [2025-03-03 13:59:58,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:59:58,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 90 [2025-03-03 13:59:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:58,412 INFO L225 Difference]: With dead ends: 129 [2025-03-03 13:59:58,412 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 13:59:58,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:59:58,413 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:58,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:59:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 13:59:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 13:59:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.16) internal successors, (58), 52 states have internal predecessors, (58), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 13:59:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2025-03-03 13:59:58,424 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 90 [2025-03-03 13:59:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:58,424 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2025-03-03 13:59:58,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2025-03-03 13:59:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2025-03-03 13:59:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 13:59:58,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:59:58,425 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:58,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:59:58,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 13:59:58,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:59:58,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:59:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash 46558699, now seen corresponding path program 3 times [2025-03-03 13:59:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:59:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723143803] [2025-03-03 13:59:58,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:59:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:59:58,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 10 equivalence classes. [2025-03-03 13:59:58,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 68 of 106 statements. [2025-03-03 13:59:58,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 13:59:58,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-03 13:59:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:59:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723143803] [2025-03-03 13:59:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723143803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:59:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679861745] [2025-03-03 13:59:58,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:59:58,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:59:58,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:59:58,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:59:58,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 106 statements into 10 equivalence classes. [2025-03-03 13:59:58,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 57 of 106 statements. [2025-03-03 13:59:58,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 13:59:58,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:59:58,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 13:59:58,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:59:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 119 proven. 37 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-03 13:59:59,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:59:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-03 13:59:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679861745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:59:59,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:59:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 8] total 23 [2025-03-03 13:59:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255388867] [2025-03-03 13:59:59,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:59:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:59:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:59:59,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:59:59,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:59:59,250 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 23 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 12 states have call successors, (35), 4 states have call predecessors, (35), 3 states have return successors, (37), 13 states have call predecessors, (37), 10 states have call successors, (37) [2025-03-03 13:59:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:59:59,458 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2025-03-03 13:59:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:59:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 12 states have call successors, (35), 4 states have call predecessors, (35), 3 states have return successors, (37), 13 states have call predecessors, (37), 10 states have call successors, (37) Word has length 106 [2025-03-03 13:59:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:59:59,460 INFO L225 Difference]: With dead ends: 93 [2025-03-03 13:59:59,460 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 13:59:59,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2025-03-03 13:59:59,461 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:59:59,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 194 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:59:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 13:59:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 13:59:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:59:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 13:59:59,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2025-03-03 13:59:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:59:59,461 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 13:59:59,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.5) internal successors, (45), 16 states have internal predecessors, (45), 12 states have call successors, (35), 4 states have call predecessors, (35), 3 states have return successors, (37), 13 states have call predecessors, (37), 10 states have call successors, (37) [2025-03-03 13:59:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 13:59:59,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 13:59:59,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:59:59,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 13:59:59,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:59:59,670 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:59:59,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 13:59:59,902 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:59:59,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:59:59 BoogieIcfgContainer [2025-03-03 13:59:59,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:59:59,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:59:59,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:59:59,911 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:59:59,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:59:50" (3/4) ... [2025-03-03 13:59:59,916 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 13:59:59,920 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-03 13:59:59,920 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-03 13:59:59,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 13:59:59,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 13:59:59,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 13:59:59,924 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 13:59:59,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:59:59,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:59:59,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:59:59,981 INFO L158 Benchmark]: Toolchain (without parser) took 9431.29ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 129.1MB in the beginning and 129.6MB in the end (delta: -460.0kB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2025-03-03 13:59:59,981 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 192.9MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:59:59,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.96ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 117.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:59:59,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.91ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 116.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:59:59,982 INFO L158 Benchmark]: Boogie Preprocessor took 18.46ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 115.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:59:59,982 INFO L158 Benchmark]: IcfgBuilder took 191.82ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 102.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:59:59,983 INFO L158 Benchmark]: TraceAbstraction took 8965.00ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 101.9MB in the beginning and 135.5MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:59:59,983 INFO L158 Benchmark]: Witness Printer took 69.06ms. Allocated memory is still 201.3MB. Free memory was 135.5MB in the beginning and 129.6MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:59:59,984 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 192.9MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.96ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 117.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.91ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 116.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.46ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 115.1MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 191.82ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 102.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8965.00ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 101.9MB in the beginning and 135.5MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.06ms. Allocated memory is still 201.3MB. Free memory was 135.5MB in the beginning and 129.6MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 1779 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1380 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1078 IncrementalHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 399 mSDtfsCounter, 1078 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1013 GetRequests, 894 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1250 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 4537 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1223 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 3954/4060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: ((((((((2 == p) && (A == 1)) && (B == 1)) && (q == 0)) && (r == 1)) && (2 == d)) || ((((p == 1) && (d == B)) && (q == 0)) && (r == A))) || ((((((d == 1) && (p == 1)) && (A == 1)) && (B == 1)) && (r == 0)) && (q == 1))) - InvariantResult [Line: 36]: Location Invariant Derived location invariant: (((((((2 == p) && (B == 1)) && (q == 0)) && (r == 1)) && (r == A)) && (2 == d)) || ((((((d == 1) && (p == 1)) && (r <= 1)) && (B == 1)) && (q == 0)) && (r == A))) RESULT: Ultimate proved your program to be correct! [2025-03-03 14:00:00,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE