./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-?-798a7b3-m [2025-03-03 14:08:49,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:08:49,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:08:49,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:08:49,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:08:49,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:08:49,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:08:49,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:08:49,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:08:49,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:08:49,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:08:49,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:08:49,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:08:49,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:08:49,510 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:08:49,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:08:49,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:08:49,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:08:49,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:08:49,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:08:49,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:08:49,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:08:49,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:08:49,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:08:49,513 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-03 14:08:49,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:08:49,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:08:49,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:08:49,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:08:49,735 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:08:49,736 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-03 14:08:50,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00edaf420/415fc7a4d9014cf99f84e0a7b8b74049/FLAG9aeca6901 [2025-03-03 14:08:51,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:08:51,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c [2025-03-03 14:08:51,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00edaf420/415fc7a4d9014cf99f84e0a7b8b74049/FLAG9aeca6901 [2025-03-03 14:08:51,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00edaf420/415fc7a4d9014cf99f84e0a7b8b74049 [2025-03-03 14:08:51,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:08:51,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:08:51,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:08:51,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:08:51,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:08:51,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2c73bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51, skipping insertion in model container [2025-03-03 14:08:51,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:08:51,510 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-03 14:08:51,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:08:51,528 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:08:51,536 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-03 14:08:51,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:08:51,549 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:08:51,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51 WrapperNode [2025-03-03 14:08:51,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:08:51,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:08:51,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:08:51,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:08:51,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,570 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-03-03 14:08:51,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:08:51,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:08:51,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:08:51,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:08:51,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,585 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:08:51,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:08:51,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:08:51,595 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:08:51,595 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:08:51,596 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (1/1) ... [2025-03-03 14:08:51,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:08:51,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:51,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:08:51,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:08:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:08:51,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:08:51,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:08:51,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:08:51,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 14:08:51,641 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 14:08:51,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:08:51,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:08:51,791 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-03 14:08:51,791 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:08:51,800 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:08:51,800 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:08:51,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:08:51 BoogieIcfgContainer [2025-03-03 14:08:51,800 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:08:51,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:08:51,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:08:51,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:08:51,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:08:51" (1/3) ... [2025-03-03 14:08:51,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522de32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:08:51, skipping insertion in model container [2025-03-03 14:08:51,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:08:51" (2/3) ... [2025-03-03 14:08:51,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522de32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:08:51, skipping insertion in model container [2025-03-03 14:08:51,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:08:51" (3/3) ... [2025-03-03 14:08:51,808 INFO L128 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound5.c [2025-03-03 14:08:51,820 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:08:51,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps4-ll_unwindbound5.c that has 2 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:08:51,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:08:51,878 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;@6fab89e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:08:51,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:08:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-03 14:08:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 14:08:51,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:51,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:51,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:51,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1710924184, now seen corresponding path program 1 times [2025-03-03 14:08:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188892587] [2025-03-03 14:08:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:51,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:51,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 14:08:51,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 14:08:51,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:51,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:08:52,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:08:52,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188892587] [2025-03-03 14:08:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188892587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:08:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:08:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:08:52,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444331507] [2025-03-03 14:08:52,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:08:52,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:08:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:08:52,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:08:52,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:08:52,025 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3.0) internal successors, (6), 2 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-03 14:08:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:08:52,038 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2025-03-03 14:08:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:08:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-03 14:08:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:08:52,043 INFO L225 Difference]: With dead ends: 34 [2025-03-03 14:08:52,044 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 14:08:52,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:08:52,047 INFO L435 NwaCegarLoop]: 21 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, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:08:52,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:08:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 14:08:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 14:08:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-03 14:08:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-03-03 14:08:52,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2025-03-03 14:08:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:08:52,073 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-03 14:08:52,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-03 14:08:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-03-03 14:08:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 14:08:52,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:52,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:52,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:08:52,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1541343401, now seen corresponding path program 1 times [2025-03-03 14:08:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362791317] [2025-03-03 14:08:52,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:52,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 14:08:52,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 14:08:52,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:52,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:08:52,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99201490] [2025-03-03 14:08:52,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:52,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:52,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:52,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:08:52,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:08:52,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 14:08:52,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 14:08:52,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:52,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:52,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:08:52,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:08:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:08:52,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:08:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:08:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362791317] [2025-03-03 14:08:52,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:08:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99201490] [2025-03-03 14:08:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99201490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:08:52,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:08:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:08:52,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932879879] [2025-03-03 14:08:52,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:08:52,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:08:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:08:52,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:08:52,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:08:52,243 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:08:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:08:52,298 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-03 14:08:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:08:52,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-03-03 14:08:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:08:52,299 INFO L225 Difference]: With dead ends: 26 [2025-03-03 14:08:52,299 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 14:08:52,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:08:52,300 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 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-03 14:08:52,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:08:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 14:08:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 14:08:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-03 14:08:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-03-03 14:08:52,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2025-03-03 14:08:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:08:52,304 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-03-03 14:08:52,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:08:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-03-03 14:08:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 14:08:52,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:52,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:52,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:08:52,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:52,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:52,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1287473565, now seen corresponding path program 1 times [2025-03-03 14:08:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:52,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583792824] [2025-03-03 14:08:52,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:52,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:52,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:08:52,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:08:52,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:52,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:08:52,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474576714] [2025-03-03 14:08:52,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:52,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:52,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:52,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:08:52,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:08:52,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:08:52,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:08:52,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:52,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:52,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:08:52,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:08:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:08:52,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:08:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:08:52,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:08:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583792824] [2025-03-03 14:08:52,789 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:08:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474576714] [2025-03-03 14:08:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474576714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:08:52,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:08:52,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2025-03-03 14:08:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705612961] [2025-03-03 14:08:52,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:08:52,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:08:52,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:08:52,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:08:52,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:08:52,791 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:08:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:08:52,850 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2025-03-03 14:08:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:08:52,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 16 [2025-03-03 14:08:52,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:08:52,851 INFO L225 Difference]: With dead ends: 34 [2025-03-03 14:08:52,851 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 14:08:52,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 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-03 14:08:52,852 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:08:52,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 70 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:08:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 14:08:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-03-03 14:08:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-03 14:08:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-03 14:08:52,859 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2025-03-03 14:08:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:08:52,860 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-03 14:08:52,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:08:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-03 14:08:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 14:08:52,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:52,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:52,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:08:53,065 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-03 14:08:53,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:53,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1288337504, now seen corresponding path program 1 times [2025-03-03 14:08:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631108409] [2025-03-03 14:08:53,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:53,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:08:53,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:08:53,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:53,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:08:53,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:08:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631108409] [2025-03-03 14:08:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631108409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:08:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217067605] [2025-03-03 14:08:53,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:53,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:53,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:53,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:08:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:08:53,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:08:53,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:08:53,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:53,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:53,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:08:53,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:08:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:08:53,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:08:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:08:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217067605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:08:53,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:08:53,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-03 14:08:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561893529] [2025-03-03 14:08:53,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:08:53,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:08:53,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:08:53,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:08:53,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:08:53,285 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-03 14:08:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:08:53,337 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2025-03-03 14:08:53,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:08:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 16 [2025-03-03 14:08:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:08:53,337 INFO L225 Difference]: With dead ends: 56 [2025-03-03 14:08:53,337 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:08:53,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 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-03 14:08:53,339 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:08:53,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 57 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:08:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:08:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2025-03-03 14:08:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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-03 14:08:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-03-03 14:08:53,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2025-03-03 14:08:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:08:53,346 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-03-03 14:08:53,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-03 14:08:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-03-03 14:08:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 14:08:53,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:53,347 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:53,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:08:53,547 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-03 14:08:53,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:53,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1900616027, now seen corresponding path program 1 times [2025-03-03 14:08:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851496278] [2025-03-03 14:08:53,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:53,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 14:08:53,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 14:08:53,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:53,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:08:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047630867] [2025-03-03 14:08:53,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:08:53,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:53,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:53,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:08:53,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:08:53,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 14:08:53,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 14:08:53,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:53,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:53,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:08:53,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:08:53,668 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-03 14:08:53,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:08:53,747 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-03 14:08:53,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:08:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851496278] [2025-03-03 14:08:53,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:08:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047630867] [2025-03-03 14:08:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047630867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:08:53,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:08:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 14:08:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483897923] [2025-03-03 14:08:53,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:08:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:08:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:08:53,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:08:53,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:08:53,748 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-03 14:08:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:08:53,861 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-03-03 14:08:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:08:53,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 22 [2025-03-03 14:08:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:08:53,863 INFO L225 Difference]: With dead ends: 49 [2025-03-03 14:08:53,863 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 14:08:53,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 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-03 14:08:53,864 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:08:53,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:08:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 14:08:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-03 14:08:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-03 14:08:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2025-03-03 14:08:53,893 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 22 [2025-03-03 14:08:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:08:53,893 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2025-03-03 14:08:53,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-03 14:08:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2025-03-03 14:08:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 14:08:53,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:53,894 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:53,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:08:54,094 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-03 14:08:54,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:54,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1437496526, now seen corresponding path program 2 times [2025-03-03 14:08:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88183912] [2025-03-03 14:08:54,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:08:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:54,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-03 14:08:54,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:08:54,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:08:54,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:54,297 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-03 14:08:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:08:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88183912] [2025-03-03 14:08:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88183912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:08:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74159026] [2025-03-03 14:08:54,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:08:54,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:54,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:54,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:08:54,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:08:54,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-03 14:08:54,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 14:08:54,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:08:54,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:54,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:08:54,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:08:54,401 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-03 14:08:54,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:08:54,474 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-03 14:08:54,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74159026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:08:54,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:08:54,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2025-03-03 14:08:54,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291692848] [2025-03-03 14:08:54,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:08:54,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:08:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:08:54,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:08:54,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:08:54,475 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-03 14:08:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:08:54,542 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2025-03-03 14:08:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:08:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 40 [2025-03-03 14:08:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:08:54,543 INFO L225 Difference]: With dead ends: 54 [2025-03-03 14:08:54,543 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 14:08:54,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 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-03 14:08:54,544 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:08:54,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:08:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 14:08:54,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 14:08:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 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-03 14:08:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2025-03-03 14:08:54,557 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 40 [2025-03-03 14:08:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:08:54,557 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2025-03-03 14:08:54,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-03 14:08:54,557 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2025-03-03 14:08:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 14:08:54,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:54,559 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:54,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:08:54,763 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-03 14:08:54,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:54,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash 332791, now seen corresponding path program 2 times [2025-03-03 14:08:54,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:54,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459679130] [2025-03-03 14:08:54,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:08:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:54,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-03 14:08:54,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 14:08:54,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:08:54,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:08:54,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764890183] [2025-03-03 14:08:54,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:08:54,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:54,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:54,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:08:54,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:08:54,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-03 14:08:54,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 14:08:54,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:08:54,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:08:54,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 14:08:54,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:08:55,022 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-03 14:08:55,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:08:55,285 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-03 14:08:55,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:08:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459679130] [2025-03-03 14:08:55,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 14:08:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764890183] [2025-03-03 14:08:55,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764890183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:08:55,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:08:55,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2025-03-03 14:08:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411249588] [2025-03-03 14:08:55,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 14:08:55,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:08:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:08:55,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:08:55,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:08:55,288 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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-03 14:08:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:08:55,526 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2025-03-03 14:08:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:08:55,526 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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 46 [2025-03-03 14:08:55,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:08:55,527 INFO L225 Difference]: With dead ends: 57 [2025-03-03 14:08:55,527 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:08:55,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 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-03 14:08:55,528 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:08:55,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 240 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:08:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:08:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-03 14:08:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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-03 14:08:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2025-03-03 14:08:55,539 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2025-03-03 14:08:55,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:08:55,539 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2025-03-03 14:08:55,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 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-03 14:08:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2025-03-03 14:08:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 14:08:55,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:08:55,540 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-03 14:08:55,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:08:55,740 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-03 14:08:55,740 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:08:55,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:08:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1713587576, now seen corresponding path program 3 times [2025-03-03 14:08:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:08:55,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282464919] [2025-03-03 14:08:55,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:08:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:08:55,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 6 equivalence classes. [2025-03-03 14:08:55,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:08:55,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:08:55,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 14:08:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258766279] [2025-03-03 14:08:55,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:08:55,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:08:55,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:08:55,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:08:55,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:08:55,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 6 equivalence classes. [2025-03-03 14:08:55,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:08:55,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:08:55,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:08:55,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:08:55,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 14:08:55,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:08:55,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:08:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:08:55,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:08:55,826 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:08:55,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:08:55,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:08:56,028 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-03 14:08:56,031 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-03-03 14:08:56,046 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:08:56,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:08:56 BoogieIcfgContainer [2025-03-03 14:08:56,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:08:56,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:08:56,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:08:56,049 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:08:56,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:08:51" (3/4) ... [2025-03-03 14:08:56,050 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:08:56,082 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 35. [2025-03-03 14:08:56,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:08:56,137 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:08:56,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:08:56,138 INFO L158 Benchmark]: Toolchain (without parser) took 4745.37ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 84.8MB in the end (delta: 29.9MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2025-03-03 14:08:56,139 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:08:56,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.31ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 103.5MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:08:56,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.44ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:08:56,139 INFO L158 Benchmark]: Boogie Preprocessor took 21.85ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:08:56,139 INFO L158 Benchmark]: IcfgBuilder took 207.10ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.4MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:08:56,139 INFO L158 Benchmark]: TraceAbstraction took 4245.50ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 91.8MB in the end (delta: -2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:08:56,139 INFO L158 Benchmark]: Witness Printer took 88.51ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 84.8MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:08:56,140 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.31ms. Allocated memory is still 142.6MB. Free memory was 114.7MB in the beginning and 103.5MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.44ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.85ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 207.10ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 90.4MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4245.50ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 91.8MB in the end (delta: -2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 88.51ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 84.8MB 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; VAL [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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 617 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 505 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 112 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 230 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 1365 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-03 14:08:56,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE