./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_o20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/recursive-simple/id_o20.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 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:00:10,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:00:10,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:00:10,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:00:10,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:00:10,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:00:10,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:00:10,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:00:10,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:00:10,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:00:10,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:00:10,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:00:10,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:00:10,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:00:10,225 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:00:10,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:00:10,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:00:10,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:00:10,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:00:10,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:00:10,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:00:10,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:00:10,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:00:10,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:00:10,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:00:10,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:00:10,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:00:10,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:00:10,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:00:10,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:00:10,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:00:10,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:00:10,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:00:10,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:00:10,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:00:10,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:00:10,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:00:10,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:00:10,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:00:10,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:00:10,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:00:10,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:00:10,235 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d [2024-11-11 21:00:10,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:00:10,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:00:10,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:00:10,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:00:10,501 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:00:10,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_o20.c [2024-11-11 21:00:11,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:00:11,937 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:00:11,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c [2024-11-11 21:00:11,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead1f4434/f78e707ae7db4fc8805d8f33db65701f/FLAG7af554734 [2024-11-11 21:00:12,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ead1f4434/f78e707ae7db4fc8805d8f33db65701f [2024-11-11 21:00:12,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:00:12,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:00:12,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:00:12,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:00:12,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:00:12,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f000e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12, skipping insertion in model container [2024-11-11 21:00:12,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:00:12,522 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/recursive-simple/id_o20.c[516,529] [2024-11-11 21:00:12,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:00:12,536 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:00:12,547 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/recursive-simple/id_o20.c[516,529] [2024-11-11 21:00:12,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:00:12,561 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:00:12,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12 WrapperNode [2024-11-11 21:00:12,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:00:12,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:00:12,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:00:12,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:00:12,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,590 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-11 21:00:12,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:00:12,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:00:12,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:00:12,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:00:12,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,608 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]. [2024-11-11 21:00:12,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:00:12,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:00:12,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:00:12,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:00:12,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (1/1) ... [2024-11-11 21:00:12,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:00:12,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:12,643 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) [2024-11-11 21:00:12,646 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 [2024-11-11 21:00:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:00:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:00:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:00:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:00:12,688 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-11-11 21:00:12,688 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-11-11 21:00:12,742 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:00:12,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:00:12,833 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-11 21:00:12,833 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:00:12,844 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:00:12,844 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:00:12,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:12 BoogieIcfgContainer [2024-11-11 21:00:12,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:00:12,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:00:12,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:00:12,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:00:12,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:00:12" (1/3) ... [2024-11-11 21:00:12,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46967911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:00:12, skipping insertion in model container [2024-11-11 21:00:12,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:00:12" (2/3) ... [2024-11-11 21:00:12,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46967911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:00:12, skipping insertion in model container [2024-11-11 21:00:12,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:12" (3/3) ... [2024-11-11 21:00:12,854 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o20.c [2024-11-11 21:00:12,870 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:00:12,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:00:12,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:00:12,932 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;@5b821d5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:00:12,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:00:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 21:00:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 21:00:12,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:12,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:12,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:12,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2024-11-11 21:00:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266489997] [2024-11-11 21:00:12,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:00:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266489997] [2024-11-11 21:00:13,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266489997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:00:13,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:00:13,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:00:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602105986] [2024-11-11 21:00:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:00:13,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:00:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:13,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:00:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:00:13,320 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:00:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:13,362 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-11 21:00:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:00:13,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-11 21:00:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:13,370 INFO L225 Difference]: With dead ends: 25 [2024-11-11 21:00:13,370 INFO L226 Difference]: Without dead ends: 15 [2024-11-11 21:00:13,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:00:13,377 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:13,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-11 21:00:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-11 21:00:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 21:00:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-11 21:00:13,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-11-11 21:00:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:13,415 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-11 21:00:13,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:00:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-11 21:00:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 21:00:13,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:13,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:13,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:00:13,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:13,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2024-11-11 21:00:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:13,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205540393] [2024-11-11 21:00:13,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:13,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:13,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205540393] [2024-11-11 21:00:13,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205540393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:13,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939191052] [2024-11-11 21:00:13,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:13,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:13,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:13,653 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) [2024-11-11 21:00:13,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:00:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:13,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 21:00:13,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:13,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:00:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939191052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:13,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-11 21:00:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240074205] [2024-11-11 21:00:13,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:00:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:13,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:00:13,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:00:13,920 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:00:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:13,974 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-11 21:00:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:00:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 16 [2024-11-11 21:00:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:13,975 INFO L225 Difference]: With dead ends: 27 [2024-11-11 21:00:13,975 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 21:00:13,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:00:13,977 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:13,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:00:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 21:00:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 21:00:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:00:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-11 21:00:13,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-11-11 21:00:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:13,986 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-11 21:00:13,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:00:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-11 21:00:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 21:00:13,988 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:13,988 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:14,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:00:14,192 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 [2024-11-11 21:00:14,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 2 times [2024-11-11 21:00:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070464402] [2024-11-11 21:00:14,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070464402] [2024-11-11 21:00:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070464402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815101925] [2024-11-11 21:00:14,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 21:00:14,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:14,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:14,521 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) [2024-11-11 21:00:14,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:00:14,556 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 21:00:14,556 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:14,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:00:14,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:14,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:00:14,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815101925] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:14,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-11 21:00:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119539025] [2024-11-11 21:00:14,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:14,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:00:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:00:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:00:14,894 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:00:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:15,041 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-11-11 21:00:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:00:15,042 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 28 [2024-11-11 21:00:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:15,043 INFO L225 Difference]: With dead ends: 39 [2024-11-11 21:00:15,043 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 21:00:15,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:00:15,045 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:15,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 21:00:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 21:00:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-11 21:00:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-11 21:00:15,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2024-11-11 21:00:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-11 21:00:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:00:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-11 21:00:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:00:15,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:15,057 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:15,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:00:15,260 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 [2024-11-11 21:00:15,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 3 times [2024-11-11 21:00:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931607900] [2024-11-11 21:00:15,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931607900] [2024-11-11 21:00:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931607900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942683291] [2024-11-11 21:00:15,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 21:00:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:15,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:15,858 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) [2024-11-11 21:00:15,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:00:15,913 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-11 21:00:15,913 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:15,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-11 21:00:15,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:15,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-11 21:00:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942683291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:16,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:16,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2024-11-11 21:00:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628350595] [2024-11-11 21:00:16,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:16,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 21:00:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:16,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 21:00:16,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 21:00:16,751 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-11 21:00:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:17,531 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-11-11 21:00:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-11 21:00:17,533 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 52 [2024-11-11 21:00:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:17,534 INFO L225 Difference]: With dead ends: 63 [2024-11-11 21:00:17,534 INFO L226 Difference]: Without dead ends: 57 [2024-11-11 21:00:17,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2024-11-11 21:00:17,536 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:17,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:00:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-11 21:00:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-11 21:00:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-11 21:00:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-11 21:00:17,555 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2024-11-11 21:00:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:17,555 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-11 21:00:17,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-11 21:00:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-11 21:00:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:00:17,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:17,558 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:17,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:17,758 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 [2024-11-11 21:00:17,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 4 times [2024-11-11 21:00:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:17,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66404577] [2024-11-11 21:00:17,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:00:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:00:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:00:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:00:19,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66404577] [2024-11-11 21:00:19,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66404577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:00:19,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004336739] [2024-11-11 21:00:19,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 21:00:19,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:00:19,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:00:19,432 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) [2024-11-11 21:00:19,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:00:19,482 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 21:00:19,482 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 21:00:19,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-11 21:00:19,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:00:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:00:19,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:00:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-11-11 21:00:21,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004336739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:00:21,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:00:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2024-11-11 21:00:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326838253] [2024-11-11 21:00:21,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:00:21,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-11-11 21:00:21,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:00:21,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-11-11 21:00:21,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2024-11-11 21:00:21,621 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-11 21:00:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:00:39,928 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2024-11-11 21:00:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-11 21:00:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 100 [2024-11-11 21:00:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:00:39,930 INFO L225 Difference]: With dead ends: 111 [2024-11-11 21:00:39,930 INFO L226 Difference]: Without dead ends: 105 [2024-11-11 21:00:39,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=1291, Invalid=8021, Unknown=0, NotChecked=0, Total=9312 [2024-11-11 21:00:39,932 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:00:39,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1479 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:00:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-11 21:00:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-11 21:00:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 71 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (34), 32 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-11 21:00:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2024-11-11 21:00:39,947 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2024-11-11 21:00:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:00:39,947 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2024-11-11 21:00:39,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-11 21:00:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2024-11-11 21:00:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 21:00:39,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:00:39,949 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:00:39,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 21:00:40,149 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 [2024-11-11 21:00:40,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:00:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:00:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1807457588, now seen corresponding path program 5 times [2024-11-11 21:00:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:00:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941233200] [2024-11-11 21:00:40,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:00:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:00:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:00:40,222 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 21:00:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:00:40,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 21:00:40,307 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 21:00:40,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:00:40,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:00:40,311 INFO L421 BasicCegarLoop]: Path program histogram: [5, 1] [2024-11-11 21:00:40,349 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:00:40,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:00:40 BoogieIcfgContainer [2024-11-11 21:00:40,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:00:40,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:00:40,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:00:40,352 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:00:40,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:00:12" (3/4) ... [2024-11-11 21:00:40,353 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 21:00:40,396 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:00:40,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:00:40,397 INFO L158 Benchmark]: Toolchain (without parser) took 28040.87ms. Allocated memory was 176.2MB in the beginning and 310.4MB in the end (delta: 134.2MB). Free memory was 108.1MB in the beginning and 250.0MB in the end (delta: -141.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:00:40,399 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:00:40,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.02ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 96.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 21:00:40,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.24ms. Allocated memory is still 176.2MB. Free memory was 95.8MB in the beginning and 94.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:00:40,400 INFO L158 Benchmark]: Boogie Preprocessor took 22.04ms. Allocated memory is still 176.2MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:00:40,400 INFO L158 Benchmark]: RCFGBuilder took 230.92ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 82.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 21:00:40,400 INFO L158 Benchmark]: TraceAbstraction took 27505.85ms. Allocated memory was 176.2MB in the beginning and 310.4MB in the end (delta: 134.2MB). Free memory was 82.0MB in the beginning and 253.2MB in the end (delta: -171.1MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. [2024-11-11 21:00:40,400 INFO L158 Benchmark]: Witness Printer took 44.87ms. Allocated memory is still 310.4MB. Free memory was 253.2MB in the beginning and 250.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:00:40,401 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.10ms. Allocated memory is still 117.4MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.02ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 96.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.24ms. Allocated memory is still 176.2MB. Free memory was 95.8MB in the beginning and 94.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.04ms. Allocated memory is still 176.2MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 230.92ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 82.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27505.85ms. Allocated memory was 176.2MB in the beginning and 310.4MB in the end (delta: 134.2MB). Free memory was 82.0MB in the beginning and 253.2MB in the end (delta: -171.1MB). Peak memory consumption was 114.8MB. Max. memory is 16.1GB. * Witness Printer took 44.87ms. Allocated memory is still 310.4MB. Free memory was 253.2MB in the beginning and 250.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] unsigned int input = __VERIFIER_nondet_uint(); [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, x=20] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=20] [L13] unsigned int result = id(input); [L14] COND TRUE result == 20 VAL [input=20] [L15] reach_error() VAL [input=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 2289 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2168 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 121 mSDtfsCounter, 1014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=5, InterpolantAutomatonStates: 137, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 1619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 1317/2634 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-11 21:00:40,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE