./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.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 66de7f8dcfecba0155136bf2ae50cf69773125ef386b1007a2b643875d1f6943 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:07:39,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:07:39,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:07:39,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:07:39,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:07:39,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:07:39,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:07:39,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:07:39,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:07:39,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:07:39,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:07:39,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:07:39,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:07:39,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:07:39,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:07:39,639 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:07:39,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:07:39,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:07:39,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:07:39,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:07:39,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:07:39,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:07:39,642 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 -> 66de7f8dcfecba0155136bf2ae50cf69773125ef386b1007a2b643875d1f6943 [2025-03-03 14:07:39,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:07:39,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:07:39,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:07:39,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:07:39,868 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:07:39,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2025-03-03 14:07:40,965 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc665cef/193e42179ade413abe179aa69a2dcc26/FLAGea00c3341 [2025-03-03 14:07:41,181 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:07:41,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_unwindbound2.c [2025-03-03 14:07:41,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc665cef/193e42179ade413abe179aa69a2dcc26/FLAGea00c3341 [2025-03-03 14:07:41,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc665cef/193e42179ade413abe179aa69a2dcc26 [2025-03-03 14:07:41,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:07:41,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:07:41,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:07:41,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:07:41,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:07:41,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c7fe49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41, skipping insertion in model container [2025-03-03 14:07:41,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:07:41,634 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/prodbin-ll_unwindbound2.c[1175,1188] [2025-03-03 14:07:41,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:07:41,650 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:07:41,657 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/prodbin-ll_unwindbound2.c[1175,1188] [2025-03-03 14:07:41,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:07:41,669 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:07:41,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41 WrapperNode [2025-03-03 14:07:41,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:07:41,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:07:41,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:07:41,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:07:41,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,691 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-03 14:07:41,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:07:41,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:07:41,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:07:41,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:07:41,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,704 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:07:41,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:07:41,709 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:07:41,709 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:07:41,709 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:07:41,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (1/1) ... [2025-03-03 14:07:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:07:41,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:41,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:07:41,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:07:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:07:41,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:07:41,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:07:41,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:07:41,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:07:41,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:07:41,801 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:07:41,802 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:07:41,912 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 14:07:41,912 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:07:41,922 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:07:41,922 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:07:41,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:07:41 BoogieIcfgContainer [2025-03-03 14:07:41,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:07:41,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:07:41,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:07:41,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:07:41,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:07:41" (1/3) ... [2025-03-03 14:07:41,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48554013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:07:41, skipping insertion in model container [2025-03-03 14:07:41,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:07:41" (2/3) ... [2025-03-03 14:07:41,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48554013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:07:41, skipping insertion in model container [2025-03-03 14:07:41,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:07:41" (3/3) ... [2025-03-03 14:07:41,929 INFO L128 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound2.c [2025-03-03 14:07:41,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:07:41,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prodbin-ll_unwindbound2.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:07:41,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:07:41,983 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;@620b8c3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:07:41,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:07:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:07:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 14:07:41,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:41,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:41,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:41,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1374148916, now seen corresponding path program 1 times [2025-03-03 14:07:42,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803269702] [2025-03-03 14:07:42,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:42,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 14:07:42,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 14:07:42,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:42,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803269702] [2025-03-03 14:07:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803269702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:07:42,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:07:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:07:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018471061] [2025-03-03 14:07:42,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:07:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:07:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:42,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:07:42,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:07:42,106 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-03 14:07:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:42,116 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2025-03-03 14:07:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:07:42,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2025-03-03 14:07:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:42,121 INFO L225 Difference]: With dead ends: 39 [2025-03-03 14:07:42,122 INFO L226 Difference]: Without dead ends: 17 [2025-03-03 14:07:42,124 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-03 14:07:42,126 INFO L435 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:42,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-03 14:07:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-03 14:07:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 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-03 14:07:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-03 14:07:42,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2025-03-03 14:07:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:42,151 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-03 14:07:42,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-03 14:07:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-03 14:07:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:07:42,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:42,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:42,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:07:42,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:42,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:42,153 INFO L85 PathProgramCache]: Analyzing trace with hash 307772215, now seen corresponding path program 1 times [2025-03-03 14:07:42,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:42,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916567916] [2025-03-03 14:07:42,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:42,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:07:42,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:07:42,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:42,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144030922] [2025-03-03 14:07:42,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:42,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:42,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:42,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:42,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:07:42,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:07:42,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:07:42,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:42,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:42,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:07:42,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:42,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:07:42,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:42,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916567916] [2025-03-03 14:07:42,438 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:07:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144030922] [2025-03-03 14:07:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144030922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:07:42,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:07:42,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:07:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472557700] [2025-03-03 14:07:42,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:07:42,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:07:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:42,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:07:42,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:07:42,439 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-03 14:07:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:42,522 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-03 14:07:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:07:42,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-03 14:07:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:42,523 INFO L225 Difference]: With dead ends: 35 [2025-03-03 14:07:42,523 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 14:07:42,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:07:42,524 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:42,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 54 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:07:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 14:07:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-03 14:07:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:07:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-03 14:07:42,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 10 [2025-03-03 14:07:42,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:42,528 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-03 14:07:42,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-03 14:07:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-03 14:07:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:07:42,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:42,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:42,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:07:42,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:42,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:42,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 308636154, now seen corresponding path program 1 times [2025-03-03 14:07:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003288592] [2025-03-03 14:07:42,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:42,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:07:42,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:07:42,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:42,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:42,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003288592] [2025-03-03 14:07:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003288592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:07:42,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:07:42,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:07:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813784081] [2025-03-03 14:07:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:07:42,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:07:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:42,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:07:42,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:07:42,829 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 14:07:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:42,843 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-03 14:07:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:07:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 14:07:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:42,845 INFO L225 Difference]: With dead ends: 32 [2025-03-03 14:07:42,845 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 14:07:42,846 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-03 14:07:42,846 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:42,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 14:07:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 14:07:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:07:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-03 14:07:42,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2025-03-03 14:07:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:42,851 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-03 14:07:42,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 14:07:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-03 14:07:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 14:07:42,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:42,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:42,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:07:42,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1350144637, now seen corresponding path program 1 times [2025-03-03 14:07:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:42,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359456983] [2025-03-03 14:07:42,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:07:42,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:07:42,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:42,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:42,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904167872] [2025-03-03 14:07:42,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:42,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:42,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:42,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:07:42,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:07:42,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:07:42,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:42,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:42,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:07:42,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:43,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:43,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:43,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359456983] [2025-03-03 14:07:43,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:07:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904167872] [2025-03-03 14:07:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904167872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:43,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:07:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2025-03-03 14:07:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914027005] [2025-03-03 14:07:43,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:07:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:43,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:07:43,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:07:43,872 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:07:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:44,162 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-03-03 14:07:44,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:07:44,162 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-03-03 14:07:44,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:44,164 INFO L225 Difference]: With dead ends: 46 [2025-03-03 14:07:44,164 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 14:07:44,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:07:44,165 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:44,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 116 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:07:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 14:07:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2025-03-03 14:07:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:07:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-03 14:07:44,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 20 [2025-03-03 14:07:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:44,172 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-03 14:07:44,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:07:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-03-03 14:07:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 14:07:44,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:44,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:44,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:07:44,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 14:07:44,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:44,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1351008576, now seen corresponding path program 1 times [2025-03-03 14:07:44,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467529214] [2025-03-03 14:07:44,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:44,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:07:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:07:44,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:44,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467529214] [2025-03-03 14:07:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467529214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:07:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028887860] [2025-03-03 14:07:44,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:44,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:44,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:44,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:44,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:07:44,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:07:44,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:07:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:44,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:44,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:07:44,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:44,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028887860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:44,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:07:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 7 [2025-03-03 14:07:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100642337] [2025-03-03 14:07:44,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:44,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:07:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:44,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:07:44,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:07:44,603 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:07:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:44,632 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-03-03 14:07:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:07:44,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-03 14:07:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:44,633 INFO L225 Difference]: With dead ends: 50 [2025-03-03 14:07:44,633 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 14:07:44,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:07:44,634 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:44,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:07:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 14:07:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-03 14:07:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:07:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-03-03 14:07:44,643 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2025-03-03 14:07:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:44,643 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-03-03 14:07:44,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 14:07:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-03-03 14:07:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 14:07:44,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:44,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:44,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:07:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:44,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1202012324, now seen corresponding path program 1 times [2025-03-03 14:07:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:44,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703254434] [2025-03-03 14:07:44,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:44,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:07:44,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:07:44,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:44,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:44,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236515603] [2025-03-03 14:07:44,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:44,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:44,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:44,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:44,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:07:44,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 14:07:44,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 14:07:44,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:44,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:44,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:07:44,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:45,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:07:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703254434] [2025-03-03 14:07:45,548 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:07:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236515603] [2025-03-03 14:07:45,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236515603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:45,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:07:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2025-03-03 14:07:45,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744069208] [2025-03-03 14:07:45,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 14:07:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:45,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 14:07:45,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:07:45,550 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:07:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:45,861 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2025-03-03 14:07:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:07:45,861 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-03-03 14:07:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:45,862 INFO L225 Difference]: With dead ends: 77 [2025-03-03 14:07:45,862 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 14:07:45,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:07:45,863 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 58 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:45,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 119 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:07:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 14:07:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-03 14:07:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 57 states have internal predecessors, (67), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:07:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-03-03 14:07:45,877 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 20 [2025-03-03 14:07:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:45,878 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-03-03 14:07:45,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:07:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-03-03 14:07:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 14:07:45,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:45,878 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:45,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:07:46,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:46,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash -514558041, now seen corresponding path program 1 times [2025-03-03 14:07:46,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818690902] [2025-03-03 14:07:46,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:46,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:46,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 14:07:46,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 14:07:46,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:46,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880689273] [2025-03-03 14:07:46,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:07:46,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:46,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:46,098 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:46,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:07:46,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 14:07:46,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 14:07:46,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:46,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:07:46,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:07:46,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:07:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:07:46,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:07:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:07:46,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:07:46,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818690902] [2025-03-03 14:07:46,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:07:46,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880689273] [2025-03-03 14:07:46,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880689273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:07:46,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:07:46,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-03-03 14:07:46,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341800767] [2025-03-03 14:07:46,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:07:46,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:07:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:07:46,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:07:46,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:07:46,228 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 14:07:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:07:46,304 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2025-03-03 14:07:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:07:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-03-03 14:07:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:07:46,306 INFO L225 Difference]: With dead ends: 75 [2025-03-03 14:07:46,306 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 14:07:46,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:07:46,306 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:07:46,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:07:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 14:07:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 14:07:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:07:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2025-03-03 14:07:46,318 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 26 [2025-03-03 14:07:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:07:46,318 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2025-03-03 14:07:46,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 14:07:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2025-03-03 14:07:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 14:07:46,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:07:46,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:46,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:07:46,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:46,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:07:46,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:07:46,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2001716986, now seen corresponding path program 2 times [2025-03-03 14:07:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:07:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053939416] [2025-03-03 14:07:46,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:07:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:07:46,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 14:07:46,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 14:07:46,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:07:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:07:46,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1948785783] [2025-03-03 14:07:46,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:07:46,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:46,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:07:46,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:07:46,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:07:46,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 14:07:46,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 14:07:46,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:07:46,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:07:46,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:07:46,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 14:07:46,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 14:07:46,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:07:46,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:07:46,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:07:46,661 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:07:46,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:07:46,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:07:46,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:07:46,870 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-03 14:07:46,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:07:46,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:07:46 BoogieIcfgContainer [2025-03-03 14:07:46,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:07:46,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:07:46,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:07:46,901 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:07:46,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:07:41" (3/4) ... [2025-03-03 14:07:46,902 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:07:46,942 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-03-03 14:07:46,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:07:46,991 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:07:46,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:07:46,992 INFO L158 Benchmark]: Toolchain (without parser) took 5465.74ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 93.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2025-03-03 14:07:46,992 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:07:46,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.48ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 93.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:07:46,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.16ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.0MB in the end (delta: 726.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:07:46,993 INFO L158 Benchmark]: Boogie Preprocessor took 17.07ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:07:46,993 INFO L158 Benchmark]: IcfgBuilder took 213.41ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 80.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:07:46,993 INFO L158 Benchmark]: TraceAbstraction took 4975.67ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 99.9MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:07:46,994 INFO L158 Benchmark]: Witness Printer took 91.15ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 93.3MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:07:46,994 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.48ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 93.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.16ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.0MB in the end (delta: 726.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.07ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 213.41ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 80.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4975.67ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 99.9MB in the end (delta: -20.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 91.15ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 93.3MB in the end (delta: 6.6MB). There was no memory consumed. 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: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int counter = 0; VAL [counter=0] [L30] int a, b; [L31] long long x, y, z; [L33] a = __VERIFIER_nondet_int() [L34] b = __VERIFIER_nondet_int() [L35] CALL assume_abort_if_not(b >= 1) [L18] COND FALSE !(!cond) VAL [counter=0] [L35] RET assume_abort_if_not(b >= 1) [L37] x = a [L38] y = b [L39] z = 0 VAL [a=2, b=7, counter=0, x=2, y=7, z=0] [L41] COND TRUE counter++<2 [L41] EXPR counter++ VAL [a=2, b=7, counter=1, x=2, y=7, z=0] [L41] COND TRUE counter++<2 [L42] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=1] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L42] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=2, b=7, counter=1, x=2, y=7, z=0] [L43] COND FALSE !(!(y != 0)) VAL [a=2, b=7, counter=1, x=2, y=7, z=0] [L46] COND TRUE y % 2 == 1 [L47] z = z + x [L48] y = y - 1 VAL [a=2, b=7, counter=1, x=2, y=6, z=2] [L50] x = 2 * x [L51] y = y / 2 VAL [a=2, b=7, counter=1, x=4, y=3, z=2] [L41] COND TRUE counter++<2 [L41] EXPR counter++ VAL [a=2, b=7, counter=2, x=4, y=3, z=2] [L41] COND TRUE counter++<2 [L42] CALL __VERIFIER_assert(z + x * y == (long long) a * b) VAL [\old(cond)=1, counter=2] [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L42] RET __VERIFIER_assert(z + x * y == (long long) a * b) VAL [a=2, b=7, counter=2, x=4, y=3, z=2] [L43] COND FALSE !(!(y != 0)) VAL [a=2, b=7, counter=2, x=4, y=3, z=2] [L46] COND TRUE y % 2 == 1 [L47] z = z + x [L48] y = y - 1 VAL [a=2, b=7, counter=2, x=4, y=2, z=6] [L50] x = 2 * x [L51] y = y / 2 VAL [a=2, b=7, counter=2, x=8, y=1, z=6] [L41] COND TRUE counter++<2 [L41] EXPR counter++ VAL [a=2, b=7, counter=3, x=8, y=1, z=6] [L41] COND FALSE !(counter++<2) [L53] CALL __VERIFIER_assert(z == (long long) a * b) VAL [\old(cond)=0, counter=3] [L21] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L23] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 492 IncrementalHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 115 mSDtfsCounter, 492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 209 ConstructedInterpolants, 3 QuantifiedInterpolants, 1190 SizeOfPredicates, 11 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 35/56 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-03 14:07:47,007 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