./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d629f4eefc4b49512b7b1b628f28a13dcdca90b36cb521919e0cc9ad875c2764 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:27:35,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:27:35,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:27:35,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:27:35,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:27:35,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:27:35,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:27:35,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:27:35,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:27:35,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:27:35,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:27:35,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:27:35,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:27:35,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:27:35,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:27:35,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:27:35,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:27:35,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:27:35,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:27:35,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d629f4eefc4b49512b7b1b628f28a13dcdca90b36cb521919e0cc9ad875c2764 [2025-03-16 18:27:36,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:27:36,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:27:36,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:27:36,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:27:36,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:27:36,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c [2025-03-16 18:27:37,367 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e606d7a/e810f3cedb86471ca5197bc31acc2891/FLAGe40f68ef3 [2025-03-16 18:27:37,623 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:27:37,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c [2025-03-16 18:27:37,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e606d7a/e810f3cedb86471ca5197bc31acc2891/FLAGe40f68ef3 [2025-03-16 18:27:37,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e606d7a/e810f3cedb86471ca5197bc31acc2891 [2025-03-16 18:27:37,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:27:37,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:27:37,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:27:37,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:27:37,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:27:37,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:27:37" (1/1) ... [2025-03-16 18:27:37,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db02b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:37, skipping insertion in model container [2025-03-16 18:27:37,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:27:37" (1/1) ... [2025-03-16 18:27:37,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:27:38,081 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/ps4-ll_unwindbound5.c[458,471] [2025-03-16 18:27:38,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:27:38,100 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:27:38,106 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/ps4-ll_unwindbound5.c[458,471] [2025-03-16 18:27:38,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:27:38,122 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:27:38,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38 WrapperNode [2025-03-16 18:27:38,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:27:38,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:27:38,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:27:38,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:27:38,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,142 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-03-16 18:27:38,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:27:38,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:27:38,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:27:38,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:27:38,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 18:27:38,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:27:38,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:27:38,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:27:38,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:27:38,166 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (1/1) ... [2025-03-16 18:27:38,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:27:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:38,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:27:38,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:27:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:27:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:27:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:27:38,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:27:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-16 18:27:38,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-16 18:27:38,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:27:38,248 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:27:38,341 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-16 18:27:38,342 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:27:38,349 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:27:38,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:27:38,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:27:38 BoogieIcfgContainer [2025-03-16 18:27:38,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:27:38,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:27:38,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:27:38,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:27:38,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:27:37" (1/3) ... [2025-03-16 18:27:38,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d83112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:27:38, skipping insertion in model container [2025-03-16 18:27:38,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:27:38" (2/3) ... [2025-03-16 18:27:38,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d83112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:27:38, skipping insertion in model container [2025-03-16 18:27:38,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:27:38" (3/3) ... [2025-03-16 18:27:38,357 INFO L128 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound5.c [2025-03-16 18:27:38,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:27:38,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps4-ll_unwindbound5.c that has 2 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:27:38,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:27:38,419 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;@25b9a937, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:27:38,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:27:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:27:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 18:27:38,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:38,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 18:27:38,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:38,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1241885435, now seen corresponding path program 1 times [2025-03-16 18:27:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169878913] [2025-03-16 18:27:38,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:38,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 18:27:38,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 18:27:38,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:38,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:27:38,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:27:38,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169878913] [2025-03-16 18:27:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169878913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:27:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:27:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 18:27:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033067242] [2025-03-16 18:27:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:27:38,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 18:27:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:27:38,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 18:27:38,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 18:27:38,561 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 18:27:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:27:38,571 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2025-03-16 18:27:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 18:27:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2025-03-16 18:27:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:27:38,576 INFO L225 Difference]: With dead ends: 31 [2025-03-16 18:27:38,576 INFO L226 Difference]: Without dead ends: 13 [2025-03-16 18:27:38,578 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-16 18:27:38,579 INFO L435 NwaCegarLoop]: 19 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, 19 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-16 18:27:38,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:27:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-16 18:27:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-16 18:27:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 18:27:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-03-16 18:27:38,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 6 [2025-03-16 18:27:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:27:38,598 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-03-16 18:27:38,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-16 18:27:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-03-16 18:27:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 18:27:38,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:38,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:27:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:27:38,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:38,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -197634910, now seen corresponding path program 1 times [2025-03-16 18:27:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711760459] [2025-03-16 18:27:38,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 18:27:38,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 18:27:38,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:38,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:27:38,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143302335] [2025-03-16 18:27:38,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:38,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:38,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:38,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:27:38,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:27:38,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 18:27:38,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 18:27:38,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:38,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:38,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:27:38,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:27:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:27:38,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:27:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:27:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711760459] [2025-03-16 18:27:38,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:27:38,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143302335] [2025-03-16 18:27:38,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143302335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:27:38,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:27:38,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:27:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449069096] [2025-03-16 18:27:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:27:38,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:27:38,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:27:38,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:27:38,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:27:38,753 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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-16 18:27:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:27:38,801 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-16 18:27:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:27:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-16 18:27:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:27:38,802 INFO L225 Difference]: With dead ends: 25 [2025-03-16 18:27:38,802 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 18:27:38,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:27:38,803 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:27:38,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 42 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:27:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 18:27:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 18:27:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:27:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-03-16 18:27:38,811 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2025-03-16 18:27:38,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:27:38,811 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-03-16 18:27:38,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 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-16 18:27:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-03-16 18:27:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 18:27:38,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:38,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:27:38,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:27:39,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:39,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:39,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1027401161, now seen corresponding path program 1 times [2025-03-16 18:27:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:39,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843774135] [2025-03-16 18:27:39,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:39,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:27:39,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:27:39,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:39,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:27:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176147719] [2025-03-16 18:27:39,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:39,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:39,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:27:39,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:27:39,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:27:39,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:27:39,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:39,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:39,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 18:27:39,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:27:39,175 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-16 18:27:39,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:27:39,269 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-16 18:27:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:27:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843774135] [2025-03-16 18:27:39,270 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:27:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176147719] [2025-03-16 18:27:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176147719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:27:39,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:27:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2025-03-16 18:27:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268864459] [2025-03-16 18:27:39,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:27:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 18:27:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:27:39,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 18:27:39,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:27:39,271 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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-16 18:27:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:27:39,348 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-16 18:27:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 18:27:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 15 [2025-03-16 18:27:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:27:39,349 INFO L225 Difference]: With dead ends: 33 [2025-03-16 18:27:39,349 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:27:39,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:27:39,350 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:27:39,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:27:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:27:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-03-16 18:27:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 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-16 18:27:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-16 18:27:39,357 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2025-03-16 18:27:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:27:39,357 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-16 18:27:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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-16 18:27:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-16 18:27:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 18:27:39,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:39,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:27:39,363 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-16 18:27:39,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 18:27:39,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1028265100, now seen corresponding path program 1 times [2025-03-16 18:27:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:39,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910281383] [2025-03-16 18:27:39,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:39,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:27:39,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:27:39,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:39,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:39,690 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-16 18:27:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:27:39,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910281383] [2025-03-16 18:27:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910281383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:27:39,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325565404] [2025-03-16 18:27:39,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:39,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:39,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:39,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:27:39,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:27:39,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 18:27:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 18:27:39,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:39,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:39,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 18:27:39,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:27:39,749 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-16 18:27:39,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:27:39,785 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-16 18:27:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325565404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:27:39,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:27:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-16 18:27:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166595301] [2025-03-16 18:27:39,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:27:39,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:27:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:27:39,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:27:39,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:27:39,788 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 18:27:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:27:39,843 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-03-16 18:27:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:27:39,843 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2025-03-16 18:27:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:27:39,844 INFO L225 Difference]: With dead ends: 55 [2025-03-16 18:27:39,844 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 18:27:39,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:27:39,844 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:27:39,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:27:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 18:27:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2025-03-16 18:27:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:27:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-16 18:27:39,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2025-03-16 18:27:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:27:39,852 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-16 18:27:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 18:27:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-16 18:27:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 18:27:39,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:39,852 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 18:27:39,858 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-16 18:27:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:40,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1114083378, now seen corresponding path program 1 times [2025-03-16 18:27:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306632002] [2025-03-16 18:27:40,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:40,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 18:27:40,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 18:27:40,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:40,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:27:40,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181502316] [2025-03-16 18:27:40,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:27:40,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:40,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:40,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:27:40,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:27:40,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 18:27:40,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 18:27:40,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:40,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:40,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 18:27:40,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:27:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:27:40,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:27:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:27:40,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:27:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306632002] [2025-03-16 18:27:40,242 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:27:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181502316] [2025-03-16 18:27:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181502316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:27:40,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:27:40,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-16 18:27:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837412232] [2025-03-16 18:27:40,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:27:40,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 18:27:40,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:27:40,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 18:27:40,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:27:40,244 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:27:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:27:40,337 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-03-16 18:27:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:27:40,338 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2025-03-16 18:27:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:27:40,339 INFO L225 Difference]: With dead ends: 48 [2025-03-16 18:27:40,339 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 18:27:40,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:27:40,339 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:27:40,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:27:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 18:27:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-16 18:27:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 18:27:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-03-16 18:27:40,351 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 21 [2025-03-16 18:27:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:27:40,351 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-03-16 18:27:40,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:27:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-03-16 18:27:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 18:27:40,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:40,352 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-16 18:27:40,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 18:27:40,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:40,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash -650428927, now seen corresponding path program 2 times [2025-03-16 18:27:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:40,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623948505] [2025-03-16 18:27:40,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:27:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:40,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 18:27:40,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 18:27:40,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:27:40,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:27:40,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:27:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623948505] [2025-03-16 18:27:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623948505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:27:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189203542] [2025-03-16 18:27:40,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:27:40,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:40,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:27:40,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:27:40,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-16 18:27:40,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 18:27:40,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:27:40,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:40,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:27:40,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:27:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:27:40,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:27:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:27:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189203542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:27:40,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:27:40,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2025-03-16 18:27:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344901523] [2025-03-16 18:27:40,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:27:40,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:27:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:27:40,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:27:40,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:27:40,921 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:27:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:27:40,976 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2025-03-16 18:27:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:27:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 39 [2025-03-16 18:27:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:27:40,977 INFO L225 Difference]: With dead ends: 53 [2025-03-16 18:27:40,977 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 18:27:40,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:27:40,978 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:27:40,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:27:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 18:27:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-16 18:27:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 18:27:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2025-03-16 18:27:40,988 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2025-03-16 18:27:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:27:40,988 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2025-03-16 18:27:40,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:27:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2025-03-16 18:27:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 18:27:40,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:40,990 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-16 18:27:40,996 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-16 18:27:41,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:41,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:41,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1917783527, now seen corresponding path program 2 times [2025-03-16 18:27:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837729956] [2025-03-16 18:27:41,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:27:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:41,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-16 18:27:41,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 18:27:41,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:27:41,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:27:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010346559] [2025-03-16 18:27:41,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:27:41,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:41,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:41,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:27:41,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:27:41,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-16 18:27:41,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 18:27:41,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:27:41,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:27:41,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 18:27:41,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:27:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 53 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:27:41,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:27:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 53 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:27:41,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:27:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837729956] [2025-03-16 18:27:41,715 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 18:27:41,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010346559] [2025-03-16 18:27:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010346559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:27:41,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:27:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2025-03-16 18:27:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627333195] [2025-03-16 18:27:41,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:27:41,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 18:27:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:27:41,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 18:27:41,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-16 18:27:41,716 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 22 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 18:27:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:27:41,929 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2025-03-16 18:27:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 18:27:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 45 [2025-03-16 18:27:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:27:41,930 INFO L225 Difference]: With dead ends: 56 [2025-03-16 18:27:41,930 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 18:27:41,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2025-03-16 18:27:41,931 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:27:41,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 211 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:27:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 18:27:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-16 18:27:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 18:27:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2025-03-16 18:27:41,938 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2025-03-16 18:27:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:27:41,939 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2025-03-16 18:27:41,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-16 18:27:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2025-03-16 18:27:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 18:27:41,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:27:41,939 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-16 18:27:41,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 18:27:42,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:42,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:27:42,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:27:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1872327464, now seen corresponding path program 3 times [2025-03-16 18:27:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:27:42,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746752268] [2025-03-16 18:27:42,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:27:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:27:42,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-16 18:27:42,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 18:27:42,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 18:27:42,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 18:27:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340147666] [2025-03-16 18:27:42,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:27:42,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:27:42,162 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:27:42,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 18:27:42,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-03-16 18:27:42,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 18:27:42,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 18:27:42,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:27:42,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 18:27:42,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 18:27:42,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 18:27:42,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:27:42,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 18:27:42,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 18:27:42,238 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 18:27:42,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:27:42,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 18:27:42,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:27:42,444 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-03-16 18:27:42,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:27:42,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:27:42 BoogieIcfgContainer [2025-03-16 18:27:42,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:27:42,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:27:42,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:27:42,463 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:27:42,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:27:38" (3/4) ... [2025-03-16 18:27:42,465 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 18:27:42,501 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 35. [2025-03-16 18:27:42,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:27:42,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:27:42,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:27:42,554 INFO L158 Benchmark]: Toolchain (without parser) took 4599.43ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 85.6MB in the end (delta: 27.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-03-16 18:27:42,554 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:27:42,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.09ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 101.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:27:42,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.19ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:27:42,554 INFO L158 Benchmark]: Boogie Preprocessor took 21.06ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.5MB in the end (delta: 897.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:27:42,555 INFO L158 Benchmark]: IcfgBuilder took 184.64ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 88.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:27:42,555 INFO L158 Benchmark]: TraceAbstraction took 4111.29ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 92.6MB in the end (delta: -5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:27:42,555 INFO L158 Benchmark]: Witness Printer took 90.17ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 85.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:27:42,556 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.09ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 101.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.19ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.06ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.5MB in the end (delta: 897.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 184.64ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 88.3MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4111.29ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 92.6MB in the end (delta: -5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 90.17ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 85.6MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [c=0, counter=0, k=7, x=0, y=0] [L27] COND TRUE counter++<5 [L27] EXPR counter++ VAL [c=0, counter=1, k=7, x=0, y=0] [L27] COND TRUE counter++<5 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=0, counter=1, k=7, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=1, counter=1, k=7, x=1, y=1] [L27] COND TRUE counter++<5 [L27] EXPR counter++ VAL [c=1, counter=2, k=7, x=1, y=1] [L27] COND TRUE counter++<5 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=1, counter=2, k=7, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=2, counter=2, k=7, x=9, y=2] [L27] COND TRUE counter++<5 [L27] EXPR counter++ VAL [c=2, counter=3, k=7, x=9, y=2] [L27] COND TRUE counter++<5 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=2, counter=3, k=7, x=9, y=2] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=3, counter=3, k=7, x=36, y=3] [L27] COND TRUE counter++<5 [L27] EXPR counter++ VAL [c=3, counter=4, k=7, x=36, y=3] [L27] COND TRUE counter++<5 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=3, counter=4, k=7, x=36, y=3] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=4, counter=4, k=7, x=100, y=4] [L27] COND TRUE counter++<5 [L27] EXPR counter++ VAL [c=4, counter=5, k=7, x=100, y=4] [L27] COND TRUE counter++<5 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=4, counter=5, k=7, x=100, y=4] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=5, counter=5, k=7, x=225, y=5] [L27] COND TRUE counter++<5 [L27] EXPR counter++ VAL [c=5, counter=6, k=7, x=225, y=5] [L27] COND FALSE !(counter++<5) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, counter=6] [L10] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L12] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 24 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 603 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 499 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 104 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 219 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, InterpolantAutomatonStates: 62, 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, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339 SizeOfPredicates, 12 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 173/418 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-16 18:27:42,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE