./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_unwindbound5.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 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:09:37,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:09:37,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:09:38,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:09:38,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:09:38,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:09:38,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:09:38,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:09:38,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:09:38,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:09:38,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:09:38,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:09:38,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:09:38,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:09:38,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:09:38,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:09:38,031 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:09:38,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:09:38,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:09:38,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:09:38,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:09:38,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:09:38,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:09:38,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:09:38,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:09:38,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:09:38,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:09:38,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:09:38,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:09:38,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:09:38,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:09:38,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:09:38,033 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 -> 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe [2025-03-08 05:09:38,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:09:38,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:09:38,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:09:38,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:09:38,269 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:09:38,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-03-08 05:09:39,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51034ca4f/1e939421b9d347808f098e345c7e3b2f/FLAG8a6491f88 [2025-03-08 05:09:39,600 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:09:39,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-03-08 05:09:39,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51034ca4f/1e939421b9d347808f098e345c7e3b2f/FLAG8a6491f88 [2025-03-08 05:09:39,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51034ca4f/1e939421b9d347808f098e345c7e3b2f [2025-03-08 05:09:39,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:09:39,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:09:39,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:09:39,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:09:39,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:09:39,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26eb532e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39, skipping insertion in model container [2025-03-08 05:09:39,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:09:39,719 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_unwindbound5.c[538,551] [2025-03-08 05:09:39,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:09:39,744 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:09:39,753 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_unwindbound5.c[538,551] [2025-03-08 05:09:39,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:09:39,771 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:09:39,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39 WrapperNode [2025-03-08 05:09:39,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:09:39,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:09:39,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:09:39,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:09:39,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,794 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-08 05:09:39,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:09:39,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:09:39,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:09:39,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:09:39,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,817 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-08 05:09:39,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:09:39,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:09:39,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:09:39,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:09:39,828 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (1/1) ... [2025-03-08 05:09:39,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:09:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:39,860 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-08 05:09:39,865 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-08 05:09:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:09:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:09:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:09:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:09:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:09:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:09:39,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:09:39,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:09:40,026 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-08 05:09:40,026 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:09:40,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:09:40,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:09:40,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:09:40 BoogieIcfgContainer [2025-03-08 05:09:40,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:09:40,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:09:40,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:09:40,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:09:40,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:09:39" (1/3) ... [2025-03-08 05:09:40,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c936782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:09:40, skipping insertion in model container [2025-03-08 05:09:40,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:09:39" (2/3) ... [2025-03-08 05:09:40,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c936782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:09:40, skipping insertion in model container [2025-03-08 05:09:40,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:09:40" (3/3) ... [2025-03-08 05:09:40,044 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound5.c [2025-03-08 05:09:40,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:09:40,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_unwindbound5.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:09:40,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:09:40,093 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;@20e7517e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:09:40,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:09:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:09:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:09:40,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:40,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:40,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:40,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash -841661746, now seen corresponding path program 1 times [2025-03-08 05:09:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149170819] [2025-03-08 05:09:40,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:40,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:09:40,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:09:40,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:40,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:09:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149170819] [2025-03-08 05:09:40,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149170819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:40,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:40,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:09:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169052954] [2025-03-08 05:09:40,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:09:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:40,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:09:40,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:09:40,218 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:09:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:40,229 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2025-03-08 05:09:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:09:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 05:09:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:40,233 INFO L225 Difference]: With dead ends: 53 [2025-03-08 05:09:40,233 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 05:09:40,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-08 05:09:40,237 INFO L435 NwaCegarLoop]: 38 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, 38 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-08 05:09:40,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 05:09:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 05:09:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:09:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-03-08 05:09:40,258 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2025-03-08 05:09:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:40,259 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-03-08 05:09:40,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:09:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2025-03-08 05:09:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:09:40,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:40,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:40,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:09:40,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:40,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash 901148589, now seen corresponding path program 1 times [2025-03-08 05:09:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153293417] [2025-03-08 05:09:40,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:40,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:09:40,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:09:40,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:40,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:09:40,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153293417] [2025-03-08 05:09:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153293417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:40,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:40,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563863027] [2025-03-08 05:09:40,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:40,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:40,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:40,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:40,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:40,421 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:09:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:40,479 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-03-08 05:09:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:40,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 05:09:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:40,482 INFO L225 Difference]: With dead ends: 38 [2025-03-08 05:09:40,482 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 05:09:40,482 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-08 05:09:40,482 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 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-08 05:09:40,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 05:09:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2025-03-08 05:09:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:09:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-08 05:09:40,492 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-03-08 05:09:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:40,492 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-08 05:09:40,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:09:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-08 05:09:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 05:09:40,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:40,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:40,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:09:40,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:40,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1774160750, now seen corresponding path program 1 times [2025-03-08 05:09:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412331949] [2025-03-08 05:09:40,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:40,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 05:09:40,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 05:09:40,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:40,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:09:40,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:40,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412331949] [2025-03-08 05:09:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412331949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:40,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:09:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548485878] [2025-03-08 05:09:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:40,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:09:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:40,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:09:40,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:09:40,554 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:09:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:40,570 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2025-03-08 05:09:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:09:40,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 05:09:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:40,571 INFO L225 Difference]: With dead ends: 44 [2025-03-08 05:09:40,571 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 05:09:40,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:09:40,572 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:40,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 05:09:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 05:09:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:09:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-08 05:09:40,579 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2025-03-08 05:09:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:40,579 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-08 05:09:40,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:09:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-08 05:09:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 05:09:40,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:40,580 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:40,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:09:40,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1142350440, now seen corresponding path program 1 times [2025-03-08 05:09:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331416499] [2025-03-08 05:09:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:40,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 05:09:40,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 05:09:40,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:40,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:09:40,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:40,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331416499] [2025-03-08 05:09:40,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331416499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554302370] [2025-03-08 05:09:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:40,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:40,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:40,711 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:09:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:40,772 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-03-08 05:09:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:40,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 05:09:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:40,773 INFO L225 Difference]: With dead ends: 44 [2025-03-08 05:09:40,773 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 05:09:40,773 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-08 05:09:40,773 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 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-08 05:09:40,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 05:09:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-03-08 05:09:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:09:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-03-08 05:09:40,780 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2025-03-08 05:09:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:40,780 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-08 05:09:40,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:09:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-03-08 05:09:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 05:09:40,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:40,780 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:40,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:09:40,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:40,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 205542093, now seen corresponding path program 1 times [2025-03-08 05:09:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059495037] [2025-03-08 05:09:40,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 05:09:40,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 05:09:40,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:40,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922625570] [2025-03-08 05:09:40,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:40,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:40,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:40,803 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-08 05:09:40,805 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-08 05:09:40,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 05:09:40,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 05:09:40,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:40,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:09:40,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:09:40,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:09:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059495037] [2025-03-08 05:09:40,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922625570] [2025-03-08 05:09:40,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922625570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:40,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:40,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:40,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518465346] [2025-03-08 05:09:40,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:40,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:40,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:40,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:40,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:40,912 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:09:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:40,966 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2025-03-08 05:09:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-08 05:09:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:40,967 INFO L225 Difference]: With dead ends: 63 [2025-03-08 05:09:40,967 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 05:09:40,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-08 05:09:40,968 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:40,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 05:09:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 05:09:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 05:09:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-03-08 05:09:40,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2025-03-08 05:09:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:40,975 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-03-08 05:09:40,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:09:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-03-08 05:09:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:09:40,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:40,976 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:40,982 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-08 05:09:41,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:41,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:41,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1822786374, now seen corresponding path program 1 times [2025-03-08 05:09:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587599736] [2025-03-08 05:09:41,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:41,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:09:41,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:09:41,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:41,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376449809] [2025-03-08 05:09:41,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:41,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:41,199 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-08 05:09:41,200 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-08 05:09:41,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:09:41,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:09:41,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:41,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:41,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:09:41,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:09:41,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:09:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587599736] [2025-03-08 05:09:41,459 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376449809] [2025-03-08 05:09:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376449809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:41,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:09:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-03-08 05:09:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924924272] [2025-03-08 05:09:41,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:41,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:09:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:41,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:09:41,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:09:41,460 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:09:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:41,547 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2025-03-08 05:09:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:09:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-08 05:09:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:41,550 INFO L225 Difference]: With dead ends: 66 [2025-03-08 05:09:41,550 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 05:09:41,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:09:41,550 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:41,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 116 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:09:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 05:09:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2025-03-08 05:09:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 05:09:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2025-03-08 05:09:41,559 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 28 [2025-03-08 05:09:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:41,559 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2025-03-08 05:09:41,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:09:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2025-03-08 05:09:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 05:09:41,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:41,559 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:41,565 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-08 05:09:41,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 05:09:41,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:41,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 182754622, now seen corresponding path program 1 times [2025-03-08 05:09:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:41,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845850308] [2025-03-08 05:09:41,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:41,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 05:09:41,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 05:09:41,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:41,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:09:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845850308] [2025-03-08 05:09:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845850308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799274527] [2025-03-08 05:09:41,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:41,862 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-08 05:09:41,863 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-08 05:09:41,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 05:09:41,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 05:09:41,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:41,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:09:41,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:09:41,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:09:41,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799274527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:41,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:09:41,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-03-08 05:09:41,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135744033] [2025-03-08 05:09:41,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:41,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:09:41,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:41,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:09:41,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:09:41,962 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:09:42,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:42,048 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2025-03-08 05:09:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:09:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 35 [2025-03-08 05:09:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:42,049 INFO L225 Difference]: With dead ends: 157 [2025-03-08 05:09:42,049 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 05:09:42,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:09:42,050 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:42,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:09:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 05:09:42,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2025-03-08 05:09:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 85 states have internal predecessors, (97), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 05:09:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2025-03-08 05:09:42,063 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 35 [2025-03-08 05:09:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:42,063 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2025-03-08 05:09:42,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:09:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2025-03-08 05:09:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 05:09:42,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:42,064 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:42,070 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-08 05:09:42,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:42,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:42,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash 345705026, now seen corresponding path program 1 times [2025-03-08 05:09:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:42,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883663781] [2025-03-08 05:09:42,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:42,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 05:09:42,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 05:09:42,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:42,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:42,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897387147] [2025-03-08 05:09:42,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:42,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:42,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:42,280 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-08 05:09:42,282 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-08 05:09:42,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 05:09:42,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 05:09:42,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:42,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:42,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:09:42,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:09:42,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:09:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:42,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883663781] [2025-03-08 05:09:42,477 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:42,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897387147] [2025-03-08 05:09:42,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897387147] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:42,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:09:42,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-08 05:09:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569625468] [2025-03-08 05:09:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:42,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:42,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:42,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:09:42,478 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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-08 05:09:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:42,544 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2025-03-08 05:09:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:42,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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 38 [2025-03-08 05:09:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:42,545 INFO L225 Difference]: With dead ends: 148 [2025-03-08 05:09:42,546 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 05:09:42,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:09:42,546 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 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-08 05:09:42,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 05:09:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2025-03-08 05:09:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 92 states have internal predecessors, (103), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:09:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2025-03-08 05:09:42,561 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 38 [2025-03-08 05:09:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:42,561 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2025-03-08 05:09:42,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 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-08 05:09:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2025-03-08 05:09:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:09:42,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:42,562 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 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-08 05:09:42,568 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-08 05:09:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:42,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 62896557, now seen corresponding path program 1 times [2025-03-08 05:09:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:42,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634264100] [2025-03-08 05:09:42,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:42,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:09:42,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:09:42,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:42,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 05:09:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634264100] [2025-03-08 05:09:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634264100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:42,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:09:42,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:09:42,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728555328] [2025-03-08 05:09:42,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:42,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:42,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:42,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:42,849 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:09:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:42,890 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2025-03-08 05:09:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:42,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2025-03-08 05:09:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:42,891 INFO L225 Difference]: With dead ends: 139 [2025-03-08 05:09:42,892 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 05:09:42,892 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-08 05:09:42,892 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:42,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 118 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 05:09:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-08 05:09:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 82 states have internal predecessors, (93), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 05:09:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2025-03-08 05:09:42,912 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 44 [2025-03-08 05:09:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:42,914 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2025-03-08 05:09:42,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:09:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2025-03-08 05:09:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 05:09:42,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:42,915 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:42,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:09:42,915 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:42,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash 898461349, now seen corresponding path program 1 times [2025-03-08 05:09:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116175462] [2025-03-08 05:09:42,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:42,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:42,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 05:09:42,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 05:09:42,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:42,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 05:09:43,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:43,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116175462] [2025-03-08 05:09:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116175462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45291029] [2025-03-08 05:09:43,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:43,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:43,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:43,008 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-08 05:09:43,010 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-08 05:09:43,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 05:09:43,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 05:09:43,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:43,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:43,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:09:43,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:09:43,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 05:09:43,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45291029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:43,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:09:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2025-03-08 05:09:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188153605] [2025-03-08 05:09:43,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:43,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:09:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:43,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:09:43,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:09:43,142 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 05:09:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:43,255 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2025-03-08 05:09:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:09:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 51 [2025-03-08 05:09:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:43,257 INFO L225 Difference]: With dead ends: 196 [2025-03-08 05:09:43,257 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 05:09:43,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:09:43,257 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:43,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 185 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:09:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 05:09:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2025-03-08 05:09:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 112 states have (on average 1.1785714285714286) internal successors, (132), 118 states have internal predecessors, (132), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 05:09:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2025-03-08 05:09:43,281 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 51 [2025-03-08 05:09:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:43,282 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2025-03-08 05:09:43,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-08 05:09:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2025-03-08 05:09:43,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 05:09:43,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:43,284 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:43,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:09:43,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:09:43,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:43,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash -387521360, now seen corresponding path program 1 times [2025-03-08 05:09:43,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:43,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265998190] [2025-03-08 05:09:43,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:43,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 05:09:43,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 05:09:43,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:43,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:43,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186395816] [2025-03-08 05:09:43,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:43,517 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-08 05:09:43,519 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-08 05:09:43,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 05:09:43,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 05:09:43,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:43,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:43,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 05:09:43,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 05:09:44,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 05:09:45,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:45,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265998190] [2025-03-08 05:09:45,730 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:45,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186395816] [2025-03-08 05:09:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186395816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:45,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:09:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2025-03-08 05:09:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834746793] [2025-03-08 05:09:45,731 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:45,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:09:45,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:45,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:09:45,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:09:45,732 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-08 05:09:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:46,580 INFO L93 Difference]: Finished difference Result 283 states and 361 transitions. [2025-03-08 05:09:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:09:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 60 [2025-03-08 05:09:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:46,583 INFO L225 Difference]: With dead ends: 283 [2025-03-08 05:09:46,583 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 05:09:46,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:09:46,583 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 101 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:46,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 344 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:09:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 05:09:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 198. [2025-03-08 05:09:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.1865671641791045) internal successors, (159), 140 states have internal predecessors, (159), 39 states have call successors, (39), 24 states have call predecessors, (39), 24 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 05:09:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 235 transitions. [2025-03-08 05:09:46,618 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 235 transitions. Word has length 60 [2025-03-08 05:09:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:46,618 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 235 transitions. [2025-03-08 05:09:46,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 16 states have internal predecessors, (39), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-08 05:09:46,619 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 235 transitions. [2025-03-08 05:09:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:09:46,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:46,620 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:46,626 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-08 05:09:46,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:46,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:46,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -289430514, now seen corresponding path program 1 times [2025-03-08 05:09:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:46,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627778944] [2025-03-08 05:09:46,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:46,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:09:46,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:09:46,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:46,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:09:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583677690] [2025-03-08 05:09:46,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:46,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:46,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:46,854 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-08 05:09:46,855 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-08 05:09:46,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:09:46,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:09:46,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:46,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:46,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 05:09:46,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 05:09:47,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 05:09:47,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627778944] [2025-03-08 05:09:47,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:09:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583677690] [2025-03-08 05:09:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583677690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:47,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:09:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-03-08 05:09:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455390008] [2025-03-08 05:09:47,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:09:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:47,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:09:47,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:09:47,703 INFO L87 Difference]: Start difference. First operand 198 states and 235 transitions. Second operand has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-08 05:09:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:48,176 INFO L93 Difference]: Finished difference Result 288 states and 362 transitions. [2025-03-08 05:09:48,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:09:48,177 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 71 [2025-03-08 05:09:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:48,179 INFO L225 Difference]: With dead ends: 288 [2025-03-08 05:09:48,179 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 05:09:48,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2025-03-08 05:09:48,180 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 61 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:48,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 433 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:09:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 05:09:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 209. [2025-03-08 05:09:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 142 states have (on average 1.1971830985915493) internal successors, (170), 145 states have internal predecessors, (170), 42 states have call successors, (42), 25 states have call predecessors, (42), 24 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 05:09:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-03-08 05:09:48,205 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 71 [2025-03-08 05:09:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:48,206 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-03-08 05:09:48,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-08 05:09:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-03-08 05:09:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:09:48,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:48,207 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:48,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:09:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:48,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:48,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1903297253, now seen corresponding path program 2 times [2025-03-08 05:09:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:48,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703855955] [2025-03-08 05:09:48,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:09:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:48,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-08 05:09:48,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:09:48,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:09:48,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 05:09:48,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:48,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703855955] [2025-03-08 05:09:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703855955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:48,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067038785] [2025-03-08 05:09:48,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:09:48,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:48,528 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-08 05:09:48,529 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-08 05:09:48,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-03-08 05:09:48,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:09:48,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:09:48,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:48,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:09:48,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 05:09:48,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 05:09:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067038785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:48,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:09:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 05:09:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052137625] [2025-03-08 05:09:48,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:48,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:48,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:48,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:09:48,661 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:09:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:48,712 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2025-03-08 05:09:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:09:48,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 74 [2025-03-08 05:09:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:48,715 INFO L225 Difference]: With dead ends: 233 [2025-03-08 05:09:48,715 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 05:09:48,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 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-08 05:09:48,716 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:48,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 05:09:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 05:09:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 137 states have (on average 1.1897810218978102) internal successors, (163), 140 states have internal predecessors, (163), 42 states have call successors, (42), 25 states have call predecessors, (42), 24 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 05:09:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 245 transitions. [2025-03-08 05:09:48,743 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 245 transitions. Word has length 74 [2025-03-08 05:09:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:48,744 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 245 transitions. [2025-03-08 05:09:48,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:09:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 245 transitions. [2025-03-08 05:09:48,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:09:48,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:48,746 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:48,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 05:09:48,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 05:09:48,946 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:48,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1586165993, now seen corresponding path program 1 times [2025-03-08 05:09:48,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:48,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974168103] [2025-03-08 05:09:48,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:48,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:48,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:09:48,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:09:48,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:48,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 05:09:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974168103] [2025-03-08 05:09:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974168103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118180306] [2025-03-08 05:09:49,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:49,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:49,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:49,142 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-08 05:09:49,143 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-08 05:09:49,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:09:49,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:09:49,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:49,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:49,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:09:49,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 05:09:49,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 05:09:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118180306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:49,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:09:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 17 [2025-03-08 05:09:49,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207991794] [2025-03-08 05:09:49,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:49,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 05:09:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:49,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 05:09:49,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:09:49,711 INFO L87 Difference]: Start difference. First operand 204 states and 245 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 15 states have internal predecessors, (49), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-08 05:09:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:49,909 INFO L93 Difference]: Finished difference Result 218 states and 265 transitions. [2025-03-08 05:09:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:09:49,910 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 15 states have internal predecessors, (49), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) Word has length 76 [2025-03-08 05:09:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:49,911 INFO L225 Difference]: With dead ends: 218 [2025-03-08 05:09:49,911 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 05:09:49,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:09:49,911 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 30 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:49,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 346 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:09:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 05:09:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2025-03-08 05:09:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.2016129032258065) internal successors, (149), 127 states have internal predecessors, (149), 38 states have call successors, (38), 23 states have call predecessors, (38), 22 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 05:09:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 223 transitions. [2025-03-08 05:09:49,933 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 223 transitions. Word has length 76 [2025-03-08 05:09:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:49,933 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 223 transitions. [2025-03-08 05:09:49,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 15 states have internal predecessors, (49), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-08 05:09:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 223 transitions. [2025-03-08 05:09:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:09:49,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:49,934 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2025-03-08 05:09:49,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:09:50,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:09:50,134 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:50,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1809434793, now seen corresponding path program 1 times [2025-03-08 05:09:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:50,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310116993] [2025-03-08 05:09:50,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:50,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:09:50,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:09:50,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:50,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 05:09:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310116993] [2025-03-08 05:09:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310116993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959503662] [2025-03-08 05:09:50,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:50,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:50,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:50,210 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:09:50,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:09:50,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:09:50,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:09:50,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:50,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:50,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:09:50,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-08 05:09:50,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:09:50,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959503662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:09:50,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:09:50,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-03-08 05:09:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123435803] [2025-03-08 05:09:50,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:09:50,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:09:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:50,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:09:50,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:09:50,281 INFO L87 Difference]: Start difference. First operand 185 states and 223 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:09:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:50,342 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2025-03-08 05:09:50,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:09:50,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 80 [2025-03-08 05:09:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:50,343 INFO L225 Difference]: With dead ends: 206 [2025-03-08 05:09:50,343 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 05:09:50,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 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-08 05:09:50,343 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:50,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 103 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:09:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 05:09:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2025-03-08 05:09:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 120 states have (on average 1.175) internal successors, (141), 122 states have internal predecessors, (141), 36 states have call successors, (36), 21 states have call predecessors, (36), 21 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 05:09:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 212 transitions. [2025-03-08 05:09:50,364 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 212 transitions. Word has length 80 [2025-03-08 05:09:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 212 transitions. [2025-03-08 05:09:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 05:09:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 212 transitions. [2025-03-08 05:09:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:09:50,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:50,365 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:50,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 05:09:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:09:50,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1696058278, now seen corresponding path program 1 times [2025-03-08 05:09:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260154060] [2025-03-08 05:09:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:50,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:09:50,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:09:50,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:50,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 05:09:50,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:50,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260154060] [2025-03-08 05:09:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260154060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:50,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768704575] [2025-03-08 05:09:50,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:09:50,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:50,656 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:09:50,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:09:50,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 05:09:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 05:09:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:09:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:50,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:09:50,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:09:50,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:09:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 05:09:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768704575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:09:50,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:09:50,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-03-08 05:09:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948369007] [2025-03-08 05:09:50,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:09:50,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:09:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:09:50,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:09:50,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:09:50,844 INFO L87 Difference]: Start difference. First operand 178 states and 212 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-08 05:09:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:09:50,938 INFO L93 Difference]: Finished difference Result 248 states and 308 transitions. [2025-03-08 05:09:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:09:50,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 89 [2025-03-08 05:09:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:09:50,940 INFO L225 Difference]: With dead ends: 248 [2025-03-08 05:09:50,940 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 05:09:50,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:09:50,941 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:09:50,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 142 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:09:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 05:09:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-08 05:09:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 124 states have internal predecessors, (143), 36 states have call successors, (36), 21 states have call predecessors, (36), 21 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 05:09:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2025-03-08 05:09:50,964 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 89 [2025-03-08 05:09:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:09:50,964 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2025-03-08 05:09:50,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-03-08 05:09:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2025-03-08 05:09:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:09:50,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:09:50,965 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:09:50,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 05:09:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:09:51,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:09:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:09:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1631031142, now seen corresponding path program 3 times [2025-03-08 05:09:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:09:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204922307] [2025-03-08 05:09:51,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:09:51,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:09:51,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-03-08 05:09:51,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 87 of 92 statements. [2025-03-08 05:09:51,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 05:09:51,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 05:09:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:09:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204922307] [2025-03-08 05:09:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204922307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:09:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781360345] [2025-03-08 05:09:51,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:09:51,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:09:51,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:09:51,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:09:51,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:09:51,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 8 equivalence classes. [2025-03-08 05:09:51,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 64 of 92 statements. [2025-03-08 05:09:51,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 05:09:51,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:09:51,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 05:09:51,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:09:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 05:09:51,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:10:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 05:10:04,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781360345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:10:04,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:10:04,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 32 [2025-03-08 05:10:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918758061] [2025-03-08 05:10:04,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:10:04,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 05:10:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:10:04,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 05:10:04,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:10:04,693 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 32 states, 32 states have (on average 2.59375) internal successors, (83), 31 states have internal predecessors, (83), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) [2025-03-08 05:10:14,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 05:10:22,246 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 180 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 05:10:34,769 WARN L286 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 178 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 05:10:45,274 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 182 DAG size of output: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 05:10:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:10:46,072 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2025-03-08 05:10:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 05:10:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.59375) internal successors, (83), 31 states have internal predecessors, (83), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) Word has length 92 [2025-03-08 05:10:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:10:46,074 INFO L225 Difference]: With dead ends: 228 [2025-03-08 05:10:46,074 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 05:10:46,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=731, Invalid=4239, Unknown=0, NotChecked=0, Total=4970 [2025-03-08 05:10:46,075 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 124 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:10:46,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 545 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-03-08 05:10:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 05:10:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2025-03-08 05:10:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 99 states have internal predecessors, (101), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 05:10:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2025-03-08 05:10:46,093 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 92 [2025-03-08 05:10:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:10:46,094 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2025-03-08 05:10:46,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.59375) internal successors, (83), 31 states have internal predecessors, (83), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) [2025-03-08 05:10:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2025-03-08 05:10:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:10:46,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:10:46,095 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:10:46,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 05:10:46,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:10:46,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:10:46,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:10:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1630226785, now seen corresponding path program 1 times [2025-03-08 05:10:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:10:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291642716] [2025-03-08 05:10:46,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:10:46,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:10:46,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:10:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:10:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580356364] [2025-03-08 05:10:46,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:10:46,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:10:46,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:10:46,324 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:10:46,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:10:46,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:10:46,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:10:46,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:10:46,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:10:46,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 05:10:46,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:10:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 05:10:47,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:11:02,262 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 05:11:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-08 05:11:14,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:11:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291642716] [2025-03-08 05:11:14,438 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:11:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580356364] [2025-03-08 05:11:14,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580356364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:11:14,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:11:14,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-03-08 05:11:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126605453] [2025-03-08 05:11:14,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:11:14,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:11:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:11:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:11:14,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:11:14,439 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 25 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 05:11:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:11:16,162 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2025-03-08 05:11:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:11:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 92 [2025-03-08 05:11:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:11:16,164 INFO L225 Difference]: With dead ends: 157 [2025-03-08 05:11:16,164 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 05:11:16,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-03-08 05:11:16,165 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:11:16,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 471 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:11:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 05:11:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2025-03-08 05:11:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 100 states have internal predecessors, (103), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 05:11:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2025-03-08 05:11:16,196 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 92 [2025-03-08 05:11:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:11:16,196 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2025-03-08 05:11:16,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.24) internal successors, (56), 23 states have internal predecessors, (56), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 05:11:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2025-03-08 05:11:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:11:16,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:11:16,197 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:11:16,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 05:11:16,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:11:16,397 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:11:16,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:11:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1871516767, now seen corresponding path program 2 times [2025-03-08 05:11:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:11:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124222787] [2025-03-08 05:11:16,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:11:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:11:16,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-08 05:11:16,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:11:16,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:11:16,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:11:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595210616] [2025-03-08 05:11:16,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:11:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:11:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:11:16,421 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:11:16,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:11:16,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-08 05:11:16,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:11:16,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:11:16,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:11:16,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:11:16,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:11:16,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:11:16,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:11:16,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:11:16,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:11:16,517 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:11:16,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:11:16,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 05:11:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:11:16,722 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:11:16,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:11:16,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:11:16 BoogieIcfgContainer [2025-03-08 05:11:16,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:11:16,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:11:16,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:11:16,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:11:16,750 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:09:40" (3/4) ... [2025-03-08 05:11:16,750 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:11:16,807 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 66. [2025-03-08 05:11:16,873 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:11:16,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:11:16,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:11:16,874 INFO L158 Benchmark]: Toolchain (without parser) took 97257.48ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.9MB in the beginning and 230.5MB in the end (delta: -124.6MB). Peak memory consumption was 152.7MB. Max. memory is 16.1GB. [2025-03-08 05:11:16,874 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:11:16,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.95ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:11:16,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.20ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:11:16,876 INFO L158 Benchmark]: Boogie Preprocessor took 30.00ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 92.2MB in the end (delta: 833.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:11:16,877 INFO L158 Benchmark]: IcfgBuilder took 210.05ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 79.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:11:16,877 INFO L158 Benchmark]: TraceAbstraction took 96709.83ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 78.6MB in the beginning and 238.9MB in the end (delta: -160.2MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2025-03-08 05:11:16,877 INFO L158 Benchmark]: Witness Printer took 124.66ms. Allocated memory is still 419.4MB. Free memory was 238.9MB in the beginning and 230.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:11:16,878 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.95ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.20ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.00ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 92.2MB in the end (delta: 833.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 210.05ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 79.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 96709.83ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 78.6MB in the beginning and 238.9MB in the end (delta: -160.2MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Witness Printer took 124.66ms. Allocated memory is still 419.4MB. Free memory was 238.9MB in the beginning and 230.5MB in the end (delta: 8.4MB). 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) VAL [counter=0] [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [A=4, B=1, counter=0, d=1, p=1, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=1, d=2, p=2, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=2, d=4, p=4, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=3, d=8, p=8, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L39] COND TRUE !(r >= d) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L45] COND TRUE counter++<5 [L45] EXPR counter++ VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L45] COND TRUE counter++<5 [L46] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L46] RET __VERIFIER_assert(A == q*B + r) VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L47] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L47] RET __VERIFIER_assert(d == B*p) VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L49] COND FALSE !(!(p != 1)) [L51] d = d / 2 [L52] p = p / 2 VAL [A=4, B=1, counter=5, d=4, p=4, q=0, r=4] [L53] COND TRUE r >= d [L54] r = r - d [L55] q = q + p VAL [A=4, B=1, counter=5, d=4, p=4, q=4, r=0] [L45] COND TRUE counter++<5 [L45] EXPR counter++ VAL [A=4, B=1, counter=6, d=4, p=4, q=4, r=0] [L45] COND FALSE !(counter++<5) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 49 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 96.6s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 45.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 3589 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2941 mSDsCounter, 355 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2798 IncrementalHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 355 mSolverCounterUnsat, 648 mSDtfsCounter, 2798 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1392 SyntacticMatches, 11 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 46.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=12, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 148 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 46.9s InterpolantComputationTime, 1895 NumberOfCodeBlocks, 1862 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2064 ConstructedInterpolants, 0 QuantifiedInterpolants, 38351 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1973 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 5558/6345 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:11:17,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE