./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/recursive/Ackermann02.c --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/recursive/Ackermann02.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 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:37:07,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:37:07,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:37:07,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:37:07,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:37:07,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:37:07,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:37:07,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:37:07,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:37:07,855 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:37:07,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:37:07,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:37:07,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:37:07,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:37:07,857 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:37:07,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:37:07,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:37:07,858 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:37:07,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:37:07,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:37:07,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:37:07,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:37:07,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:37:07,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:37:07,859 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:37:07,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:37:07,860 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:37:07,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:37:07,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:37:07,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:37:07,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:37:07,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:37:07,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:37:07,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:37:07,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:37:07,863 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 -> 20c02b81d1b1bc312ccc75d6e9b31c6252d69e8a6e2560afe3a2a95a3e53102a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:37:08,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:37:08,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:37:08,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:37:08,098 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:37:08,099 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:37:08,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann02.c [2023-11-22 21:37:09,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:37:09,199 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:37:09,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann02.c [2023-11-22 21:37:09,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22be07681/c586fc2aece940ca81bbf4e7ae81ca96/FLAGe1ab25dad [2023-11-22 21:37:09,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22be07681/c586fc2aece940ca81bbf4e7ae81ca96 [2023-11-22 21:37:09,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:37:09,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:37:09,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:37:09,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:37:09,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:37:09,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d0d84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09, skipping insertion in model container [2023-11-22 21:37:09,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,245 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:37:09,366 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann02.c[1157,1170] [2023-11-22 21:37:09,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:37:09,377 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:37:09,391 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann02.c[1157,1170] [2023-11-22 21:37:09,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:37:09,403 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:37:09,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09 WrapperNode [2023-11-22 21:37:09,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:37:09,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:37:09,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:37:09,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:37:09,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,429 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2023-11-22 21:37:09,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:37:09,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:37:09,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:37:09,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:37:09,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,439 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,445 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 21:37:09,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:37:09,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:37:09,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:37:09,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:37:09,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (1/1) ... [2023-11-22 21:37:09,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:37:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:37:09,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:37:09,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:37:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:37:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:37:09,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:37:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2023-11-22 21:37:09,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2023-11-22 21:37:09,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 21:37:09,579 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:37:09,580 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:37:09,668 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:37:09,686 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:37:09,686 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-22 21:37:09,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:37:09 BoogieIcfgContainer [2023-11-22 21:37:09,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:37:09,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:37:09,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:37:09,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:37:09,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:37:09" (1/3) ... [2023-11-22 21:37:09,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d50e3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:37:09, skipping insertion in model container [2023-11-22 21:37:09,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:09" (2/3) ... [2023-11-22 21:37:09,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d50e3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:37:09, skipping insertion in model container [2023-11-22 21:37:09,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:37:09" (3/3) ... [2023-11-22 21:37:09,696 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann02.c [2023-11-22 21:37:09,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:37:09,709 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:37:09,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:37:09,750 INFO L357 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, mHoare=true, 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;@1e2b71c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:37:09,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:37:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:37:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 21:37:09,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:37:09,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:37:09,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:37:09,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:37:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1538870455, now seen corresponding path program 1 times [2023-11-22 21:37:09,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:37:09,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400193418] [2023-11-22 21:37:09,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:37:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:37:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:09,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-22 21:37:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:37:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:37:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400193418] [2023-11-22 21:37:09,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400193418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:37:09,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:37:09,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:37:09,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175199367] [2023-11-22 21:37:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:37:09,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:37:09,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:37:10,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:37:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:37:10,023 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-22 21:37:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:37:10,116 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2023-11-22 21:37:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:37:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-11-22 21:37:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:37:10,124 INFO L225 Difference]: With dead ends: 46 [2023-11-22 21:37:10,124 INFO L226 Difference]: Without dead ends: 24 [2023-11-22 21:37:10,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:37:10,129 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:37:10,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 52 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:37:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-22 21:37:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-22 21:37:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-22 21:37:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-22 21:37:10,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2023-11-22 21:37:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:37:10,177 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-22 21:37:10,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2023-11-22 21:37:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-22 21:37:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-22 21:37:10,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:37:10,179 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:37:10,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:37:10,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:37:10,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:37:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash -108557995, now seen corresponding path program 1 times [2023-11-22 21:37:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:37:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941058639] [2023-11-22 21:37:10,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:37:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:37:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-22 21:37:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-22 21:37:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:37:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:37:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941058639] [2023-11-22 21:37:10,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941058639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:37:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711936433] [2023-11-22 21:37:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:37:10,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:37:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:37:10,434 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) [2023-11-22 21:37:10,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:37:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:10,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:37:10,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:37:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:37:10,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:37:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 21:37:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711936433] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:37:10,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:37:10,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2023-11-22 21:37:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082736835] [2023-11-22 21:37:10,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:37:10,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 21:37:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:37:10,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 21:37:10,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:37:10,779 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:37:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:37:10,894 INFO L93 Difference]: Finished difference Result 56 states and 90 transitions. [2023-11-22 21:37:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 21:37:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-11-22 21:37:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:37:10,897 INFO L225 Difference]: With dead ends: 56 [2023-11-22 21:37:10,897 INFO L226 Difference]: Without dead ends: 29 [2023-11-22 21:37:10,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-11-22 21:37:10,901 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:37:10,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 55 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:37:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-22 21:37:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-22 21:37:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-22 21:37:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-11-22 21:37:10,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2023-11-22 21:37:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:37:10,914 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-22 21:37:10,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:37:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-11-22 21:37:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 21:37:10,916 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:37:10,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:37:10,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 21:37:11,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:37:11,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:37:11,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:37:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1489719737, now seen corresponding path program 2 times [2023-11-22 21:37:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:37:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616405221] [2023-11-22 21:37:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:37:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:37:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-22 21:37:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:11,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-22 21:37:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-22 21:37:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:37:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:37:11,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:37:11,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616405221] [2023-11-22 21:37:11,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616405221] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:37:11,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092627851] [2023-11-22 21:37:11,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 21:37:11,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:37:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:37:11,200 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) [2023-11-22 21:37:11,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:37:11,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 21:37:11,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:37:11,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:37:11,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:37:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:37:11,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:37:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:37:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092627851] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:37:11,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:37:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-22 21:37:11,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628024628] [2023-11-22 21:37:11,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:37:11,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:37:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:37:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:37:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:37:11,314 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-22 21:37:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:37:11,346 INFO L93 Difference]: Finished difference Result 58 states and 85 transitions. [2023-11-22 21:37:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:37:11,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-11-22 21:37:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:37:11,349 INFO L225 Difference]: With dead ends: 58 [2023-11-22 21:37:11,349 INFO L226 Difference]: Without dead ends: 33 [2023-11-22 21:37:11,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:37:11,353 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:37:11,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 35 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:37:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-22 21:37:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-22 21:37:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2023-11-22 21:37:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2023-11-22 21:37:11,365 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 25 [2023-11-22 21:37:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:37:11,366 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2023-11-22 21:37:11,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-22 21:37:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2023-11-22 21:37:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 21:37:11,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:37:11,368 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:37:11,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 21:37:11,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-22 21:37:11,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:37:11,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:37:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash 110254240, now seen corresponding path program 1 times [2023-11-22 21:37:11,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:37:11,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546088242] [2023-11-22 21:37:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:37:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:37:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:37:11,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 21:37:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 21:37:11,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 21:37:11,638 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 21:37:11,639 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 21:37:11,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:37:11,645 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-11-22 21:37:11,647 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:37:11,664 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-22 21:37:11,664 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 21:37:11,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-22 21:37:11,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 21:37:11,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-22 21:37:11,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-22 21:37:11,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:37:11 BoogieIcfgContainer [2023-11-22 21:37:11,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:37:11,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:37:11,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:37:11,672 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:37:11,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:37:09" (3/4) ... [2023-11-22 21:37:11,673 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 21:37:11,676 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-22 21:37:11,676 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 21:37:11,677 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-22 21:37:11,677 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-22 21:37:11,677 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-22 21:37:11,677 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-22 21:37:11,709 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 21:37:11,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:37:11,709 INFO L158 Benchmark]: Toolchain (without parser) took 2492.06ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 81.7MB in the beginning and 109.8MB in the end (delta: -28.1MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2023-11-22 21:37:11,710 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:37:11,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.32ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 71.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 21:37:11,710 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.57ms. Allocated memory is still 155.2MB. Free memory was 71.3MB in the beginning and 69.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:37:11,710 INFO L158 Benchmark]: Boogie Preprocessor took 36.92ms. Allocated memory is still 155.2MB. Free memory was 69.8MB in the beginning and 125.1MB in the end (delta: -55.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-11-22 21:37:11,710 INFO L158 Benchmark]: RCFGBuilder took 219.48ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 125.1MB in the beginning and 166.2MB in the end (delta: -41.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2023-11-22 21:37:11,711 INFO L158 Benchmark]: TraceAbstraction took 1983.25ms. Allocated memory is still 203.4MB. Free memory was 165.1MB in the beginning and 111.9MB in the end (delta: 53.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2023-11-22 21:37:11,711 INFO L158 Benchmark]: Witness Printer took 37.11ms. Allocated memory is still 203.4MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:37:11,714 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.11ms. Allocated memory is still 155.2MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.32ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 71.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.57ms. Allocated memory is still 155.2MB. Free memory was 71.3MB in the beginning and 69.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.92ms. Allocated memory is still 155.2MB. Free memory was 69.8MB in the beginning and 125.1MB in the end (delta: -55.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * RCFGBuilder took 219.48ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 125.1MB in the beginning and 166.2MB in the end (delta: -41.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1983.25ms. Allocated memory is still 203.4MB. Free memory was 165.1MB in the beginning and 111.9MB in the end (delta: 53.2MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 37.11ms. Allocated memory is still 203.4MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 45]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int m = __VERIFIER_nondet_int(); [L29] COND FALSE !(m < 0 || m > 3) [L34] int n = __VERIFIER_nondet_int(); [L35] COND FALSE !(n < 0 || n > 23) VAL [m=2, n=0] [L41] CALL, EXPR ackermann(m,n) VAL [\old(m)=2, \old(n)=0] [L17] COND FALSE !(m==0) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L20] COND TRUE n==0 VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L21] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=1] [L17] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L20] COND FALSE !(n==0) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] CALL, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=0] [L17] COND FALSE !(m==0) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L20] COND TRUE n==0 VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L21] CALL, EXPR ackermann(m-1,1) VAL [\old(m)=0, \old(n)=1] [L17] COND TRUE m==0 [L18] return n+1; VAL [\old(m)=0, \old(n)=1, \result=2, m=0, n=1] [L21] RET, EXPR ackermann(m-1,1) VAL [\old(m)=1, \old(n)=0, m=1, n=0] [L21] return ackermann(m-1,1); [L23] RET, EXPR ackermann(m,n-1) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] CALL, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=0, \old(n)=2] [L17] COND TRUE m==0 [L18] return n+1; VAL [\old(m)=0, \old(n)=2, \result=3, m=0, n=2] [L23] RET, EXPR ackermann(m-1,ackermann(m,n-1)) VAL [\old(m)=1, \old(n)=1, m=1, n=1] [L23] return ackermann(m-1,ackermann(m,n-1)); [L21] RET, EXPR ackermann(m-1,1) VAL [\old(m)=2, \old(n)=0, m=2, n=0] [L21] return ackermann(m-1,1); [L41] RET, EXPR ackermann(m,n) VAL [m=2, n=0] [L41] int result = ackermann(m,n); [L42] COND FALSE !(m < 2 || result >= 4) VAL [m=2, n=0, result=3] [L45] reach_error() VAL [m=2, n=0, result=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 55 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 SizeOfPredicates, 3 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 46/57 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! [2023-11-22 21:37:11,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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