./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/fibo_2calls_5-2.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 eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:58:33,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:58:33,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:58:33,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:58:33,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:58:33,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:58:33,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:58:33,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:58:33,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:58:33,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:58:33,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:58:33,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:58:33,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:58:33,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:58:33,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:58:33,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:58:33,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:58:33,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:58:33,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:58:33,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:58:33,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:58:33,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:58:33,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:58:33,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:58:33,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:58:33,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:58:33,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:58:33,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:58:33,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:58:33,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:58:33,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:58:33,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:58:33,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:58:33,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:58:33,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:58:33,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:58:33,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:58:33,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:58:33,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:58:33,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:58:33,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:58:33,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:58:33,415 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 -> eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 [2024-11-16 07:58:33,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:58:33,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:58:33,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:58:33,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:58:33,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:58:33,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2024-11-16 07:58:35,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:58:35,313 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:58:35,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2024-11-16 07:58:35,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2dc988d/b8caf742d69b4a3e902f1bf8738d4997/FLAG5515845ec [2024-11-16 07:58:35,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2dc988d/b8caf742d69b4a3e902f1bf8738d4997 [2024-11-16 07:58:35,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:58:35,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:58:35,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:58:35,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:58:35,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:58:35,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82ae956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35, skipping insertion in model container [2024-11-16 07:58:35,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:58:35,537 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/fibo_2calls_5-2.c[946,959] [2024-11-16 07:58:35,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:58:35,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:58:35,567 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/fibo_2calls_5-2.c[946,959] [2024-11-16 07:58:35,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:58:35,581 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:58:35,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35 WrapperNode [2024-11-16 07:58:35,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:58:35,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:58:35,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:58:35,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:58:35,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,609 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-16 07:58:35,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:58:35,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:58:35,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:58:35,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:58:35,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,627 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-16 07:58:35,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:58:35,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:58:35,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:58:35,634 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:58:35,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (1/1) ... [2024-11-16 07:58:35,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:58:35,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:35,673 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-16 07:58:35,675 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-16 07:58:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:58:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:58:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-16 07:58:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-16 07:58:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-16 07:58:35,731 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-16 07:58:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:58:35,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:58:35,799 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:58:35,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:58:35,898 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2024-11-16 07:58:35,925 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2024-11-16 07:58:35,934 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 07:58:35,934 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:58:35,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:58:35,947 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:58:35,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:58:35 BoogieIcfgContainer [2024-11-16 07:58:35,948 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:58:35,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:58:35,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:58:35,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:58:35,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:58:35" (1/3) ... [2024-11-16 07:58:35,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bef7d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:58:35, skipping insertion in model container [2024-11-16 07:58:35,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:58:35" (2/3) ... [2024-11-16 07:58:35,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bef7d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:58:35, skipping insertion in model container [2024-11-16 07:58:35,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:58:35" (3/3) ... [2024-11-16 07:58:35,959 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2024-11-16 07:58:35,975 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:58:35,976 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:58:36,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:58:36,035 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;@4d3bd291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:58:36,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:58:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 07:58:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 07:58:36,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:36,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:36,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:36,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1889766502, now seen corresponding path program 1 times [2024-11-16 07:58:36,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:36,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197913994] [2024-11-16 07:58:36,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:36,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,391 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-16 07:58:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:36,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197913994] [2024-11-16 07:58:36,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197913994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:58:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:58:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:58:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705087013] [2024-11-16 07:58:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:58:36,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:58:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:36,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:58:36,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:58:36,419 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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) [2024-11-16 07:58:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:36,456 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-16 07:58:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:58:36,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 [2024-11-16 07:58:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:36,467 INFO L225 Difference]: With dead ends: 42 [2024-11-16 07:58:36,467 INFO L226 Difference]: Without dead ends: 28 [2024-11-16 07:58:36,470 INFO L431 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-16 07:58:36,473 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:36,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:58:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-16 07:58:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-16 07:58:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-16 07:58:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-16 07:58:36,516 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-11-16 07:58:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:36,516 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-16 07:58:36,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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) [2024-11-16 07:58:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-16 07:58:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 07:58:36,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:36,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:36,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:58:36,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:36,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1119543594, now seen corresponding path program 1 times [2024-11-16 07:58:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243422452] [2024-11-16 07:58:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,668 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-16 07:58:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243422452] [2024-11-16 07:58:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243422452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:58:36,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:58:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:58:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855447345] [2024-11-16 07:58:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:58:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:58:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:36,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:58:36,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:58:36,671 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-16 07:58:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:36,694 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-16 07:58:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:58:36,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-16 07:58:36,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:36,697 INFO L225 Difference]: With dead ends: 35 [2024-11-16 07:58:36,697 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 07:58:36,698 INFO L431 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-16 07:58:36,699 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:36,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:58:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 07:58:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-11-16 07:58:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-16 07:58:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-16 07:58:36,729 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 12 [2024-11-16 07:58:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:36,730 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-16 07:58:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-16 07:58:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-16 07:58:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 07:58:36,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:36,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:58:36,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2127390698, now seen corresponding path program 1 times [2024-11-16 07:58:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:36,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195802382] [2024-11-16 07:58:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 07:58:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:58:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:36,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195802382] [2024-11-16 07:58:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195802382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:36,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244662357] [2024-11-16 07:58:36,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:36,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:36,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:36,973 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-16 07:58:36,974 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-16 07:58:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:37,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:58:37,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:58:37,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:58:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244662357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:37,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-11-16 07:58:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328193826] [2024-11-16 07:58:37,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:37,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:58:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:37,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:58:37,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:58:37,447 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 07:58:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:37,605 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2024-11-16 07:58:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:58:37,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 24 [2024-11-16 07:58:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:37,607 INFO L225 Difference]: With dead ends: 57 [2024-11-16 07:58:37,607 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 07:58:37,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:58:37,609 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:37,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 136 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:58:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 07:58:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-16 07:58:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-16 07:58:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-16 07:58:37,621 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2024-11-16 07:58:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:37,621 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-16 07:58:37,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 13 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 07:58:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-16 07:58:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 07:58:37,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:37,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:37,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 07:58:37,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:37,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:37,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2059978289, now seen corresponding path program 1 times [2024-11-16 07:58:37,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:37,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368845566] [2024-11-16 07:58:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:37,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:37,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:37,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:58:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368845566] [2024-11-16 07:58:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368845566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121327544] [2024-11-16 07:58:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:37,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:37,986 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-16 07:58:37,988 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-16 07:58:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:58:38,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:58:38,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 07:58:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121327544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:38,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-11-16 07:58:38,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630386678] [2024-11-16 07:58:38,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:38,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:58:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:38,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:58:38,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:58:38,309 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 07:58:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:38,494 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2024-11-16 07:58:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:58:38,495 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 25 [2024-11-16 07:58:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:38,497 INFO L225 Difference]: With dead ends: 55 [2024-11-16 07:58:38,497 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 07:58:38,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-16 07:58:38,500 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:38,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 121 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:58:38,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 07:58:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-16 07:58:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.25) internal successors, (40), 34 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-16 07:58:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-11-16 07:58:38,512 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 25 [2024-11-16 07:58:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:38,512 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-11-16 07:58:38,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.0) internal successors, (33), 13 states have internal predecessors, (33), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 07:58:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-11-16 07:58:38,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 07:58:38,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:38,514 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:38,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 07:58:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-16 07:58:38,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:38,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -747014037, now seen corresponding path program 1 times [2024-11-16 07:58:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902996880] [2024-11-16 07:58:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 07:58:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:58:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 07:58:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902996880] [2024-11-16 07:58:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902996880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128543943] [2024-11-16 07:58:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:38,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:38,851 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-16 07:58:38,853 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-16 07:58:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:38,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:58:38,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 07:58:38,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:58:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128543943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:39,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:39,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-11-16 07:58:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230132965] [2024-11-16 07:58:39,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 07:58:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:39,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 07:58:39,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:58:39,304 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-16 07:58:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:39,528 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2024-11-16 07:58:39,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 07:58:39,529 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2024-11-16 07:58:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:39,531 INFO L225 Difference]: With dead ends: 111 [2024-11-16 07:58:39,531 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 07:58:39,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-16 07:58:39,533 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:39,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 153 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:58:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 07:58:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-16 07:58:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-11-16 07:58:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-11-16 07:58:39,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 37 [2024-11-16 07:58:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:39,550 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-11-16 07:58:39,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.0) internal successors, (48), 15 states have internal predecessors, (48), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-16 07:58:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-11-16 07:58:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 07:58:39,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:39,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:39,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 07:58:39,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:39,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:39,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash 335870733, now seen corresponding path program 1 times [2024-11-16 07:58:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:39,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982690579] [2024-11-16 07:58:39,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:39,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 07:58:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982690579] [2024-11-16 07:58:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982690579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000588933] [2024-11-16 07:58:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:39,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:39,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:39,923 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-16 07:58:39,924 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-16 07:58:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:39,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:58:39,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 07:58:40,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:58:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000588933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:40,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-11-16 07:58:40,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6046130] [2024-11-16 07:58:40,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:40,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 07:58:40,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:40,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 07:58:40,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-16 07:58:40,350 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 18 states, 16 states have (on average 3.1875) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-16 07:58:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:40,651 INFO L93 Difference]: Finished difference Result 181 states and 327 transitions. [2024-11-16 07:58:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 07:58:40,652 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 38 [2024-11-16 07:58:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:40,655 INFO L225 Difference]: With dead ends: 181 [2024-11-16 07:58:40,658 INFO L226 Difference]: Without dead ends: 120 [2024-11-16 07:58:40,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-16 07:58:40,663 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:40,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 283 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:58:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-16 07:58:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2024-11-16 07:58:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 68 states have internal predecessors, (79), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-11-16 07:58:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 163 transitions. [2024-11-16 07:58:40,695 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 163 transitions. Word has length 38 [2024-11-16 07:58:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:40,696 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 163 transitions. [2024-11-16 07:58:40,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-16 07:58:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 163 transitions. [2024-11-16 07:58:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 07:58:40,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:40,699 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:40,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 07:58:40,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:40,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:40,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:40,904 INFO L85 PathProgramCache]: Analyzing trace with hash -37020151, now seen corresponding path program 1 times [2024-11-16 07:58:40,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:40,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324766521] [2024-11-16 07:58:40,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:40,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:58:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-16 07:58:41,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:41,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324766521] [2024-11-16 07:58:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324766521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:41,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373325437] [2024-11-16 07:58:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:41,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:41,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:41,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:58:41,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 07:58:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:41,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 07:58:41,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 07:58:41,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 07:58:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373325437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:41,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:41,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2024-11-16 07:58:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388030502] [2024-11-16 07:58:41,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:41,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 07:58:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 07:58:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-16 07:58:41,870 INFO L87 Difference]: Start difference. First operand 101 states and 163 transitions. Second operand has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-16 07:58:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:42,210 INFO L93 Difference]: Finished difference Result 251 states and 488 transitions. [2024-11-16 07:58:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 07:58:42,211 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) Word has length 52 [2024-11-16 07:58:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:42,216 INFO L225 Difference]: With dead ends: 251 [2024-11-16 07:58:42,218 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 07:58:42,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-11-16 07:58:42,220 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:42,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 253 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:58:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 07:58:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 110. [2024-11-16 07:58:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 73 states have internal predecessors, (88), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2024-11-16 07:58:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 178 transitions. [2024-11-16 07:58:42,258 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 178 transitions. Word has length 52 [2024-11-16 07:58:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:42,259 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 178 transitions. [2024-11-16 07:58:42,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 19 states have internal predecessors, (60), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (17), 7 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-16 07:58:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 178 transitions. [2024-11-16 07:58:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-16 07:58:42,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:42,266 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:42,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-16 07:58:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:42,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:42,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -717502930, now seen corresponding path program 1 times [2024-11-16 07:58:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349130590] [2024-11-16 07:58:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:58:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 07:58:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-16 07:58:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:42,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349130590] [2024-11-16 07:58:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349130590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:42,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187397856] [2024-11-16 07:58:42,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:42,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:42,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:42,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:58:42,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 07:58:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:42,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:58:42,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 31 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-16 07:58:42,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-16 07:58:43,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187397856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:43,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:43,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 19 [2024-11-16 07:58:43,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839281658] [2024-11-16 07:58:43,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:43,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 07:58:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 07:58:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-16 07:58:43,256 INFO L87 Difference]: Start difference. First operand 110 states and 178 transitions. Second operand has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-11-16 07:58:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:43,641 INFO L93 Difference]: Finished difference Result 253 states and 495 transitions. [2024-11-16 07:58:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 07:58:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 80 [2024-11-16 07:58:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:43,645 INFO L225 Difference]: With dead ends: 253 [2024-11-16 07:58:43,645 INFO L226 Difference]: Without dead ends: 135 [2024-11-16 07:58:43,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-11-16 07:58:43,647 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:43,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 337 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:58:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-16 07:58:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2024-11-16 07:58:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 78 states have internal predecessors, (93), 23 states have call successors, (23), 11 states have call predecessors, (23), 14 states have return successors, (62), 24 states have call predecessors, (62), 23 states have call successors, (62) [2024-11-16 07:58:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 178 transitions. [2024-11-16 07:58:43,670 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 178 transitions. Word has length 80 [2024-11-16 07:58:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 178 transitions. [2024-11-16 07:58:43,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 19 states have internal predecessors, (64), 12 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-11-16 07:58:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 178 transitions. [2024-11-16 07:58:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 07:58:43,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:43,674 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:43,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 07:58:43,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:43,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:43,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2608368, now seen corresponding path program 1 times [2024-11-16 07:58:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928271364] [2024-11-16 07:58:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:58:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:58:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:58:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:58:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:58:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:58:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:58:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 126 proven. 125 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-16 07:58:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:58:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928271364] [2024-11-16 07:58:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928271364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:58:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560939548] [2024-11-16 07:58:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:44,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:44,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:58:44,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:58:44,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 07:58:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:58:44,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 07:58:44,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:58:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 120 proven. 42 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-16 07:58:44,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:58:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 120 proven. 48 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-16 07:58:45,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560939548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:58:45,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:58:45,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 11] total 30 [2024-11-16 07:58:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238162501] [2024-11-16 07:58:45,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:58:45,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-16 07:58:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:58:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-16 07:58:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2024-11-16 07:58:45,276 INFO L87 Difference]: Start difference. First operand 114 states and 178 transitions. Second operand has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 18 states have call successors, (26), 1 states have call predecessors, (26), 13 states have return successors, (32), 21 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-16 07:58:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:58:45,906 INFO L93 Difference]: Finished difference Result 230 states and 406 transitions. [2024-11-16 07:58:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-16 07:58:45,906 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 18 states have call successors, (26), 1 states have call predecessors, (26), 13 states have return successors, (32), 21 states have call predecessors, (32), 18 states have call successors, (32) Word has length 134 [2024-11-16 07:58:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:58:45,908 INFO L225 Difference]: With dead ends: 230 [2024-11-16 07:58:45,908 INFO L226 Difference]: Without dead ends: 124 [2024-11-16 07:58:45,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 291 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=384, Invalid=2268, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 07:58:45,911 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 98 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 07:58:45,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 316 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 07:58:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-16 07:58:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 99. [2024-11-16 07:58:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 67 states have internal predecessors, (80), 15 states have call successors, (15), 13 states have call predecessors, (15), 12 states have return successors, (37), 18 states have call predecessors, (37), 15 states have call successors, (37) [2024-11-16 07:58:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2024-11-16 07:58:45,921 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 134 [2024-11-16 07:58:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:58:45,922 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2024-11-16 07:58:45,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0) internal successors, (87), 30 states have internal predecessors, (87), 18 states have call successors, (26), 1 states have call predecessors, (26), 13 states have return successors, (32), 21 states have call predecessors, (32), 18 states have call successors, (32) [2024-11-16 07:58:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2024-11-16 07:58:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 07:58:45,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:58:45,923 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:45,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 07:58:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:58:46,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:58:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:58:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash 42443120, now seen corresponding path program 2 times [2024-11-16 07:58:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:58:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774705578] [2024-11-16 07:58:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:58:46,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:58:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:58:46,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:58:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:58:46,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:58:46,176 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:58:46,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:58:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 07:58:46,184 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:58:46,217 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:58:46,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:58:46 BoogieIcfgContainer [2024-11-16 07:58:46,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:58:46,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:58:46,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:58:46,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:58:46,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:58:35" (3/4) ... [2024-11-16 07:58:46,222 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:58:46,268 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:58:46,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:58:46,269 INFO L158 Benchmark]: Toolchain (without parser) took 10933.55ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 78.7MB in the beginning and 97.3MB in the end (delta: -18.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-16 07:58:46,270 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 148.9MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:58:46,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.61ms. Allocated memory is still 148.9MB. Free memory was 78.5MB in the beginning and 66.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 07:58:46,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.31ms. Allocated memory is still 148.9MB. Free memory was 66.2MB in the beginning and 64.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:58:46,270 INFO L158 Benchmark]: Boogie Preprocessor took 22.96ms. Allocated memory is still 148.9MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:58:46,271 INFO L158 Benchmark]: IcfgBuilder took 314.51ms. Allocated memory is still 148.9MB. Free memory was 63.3MB in the beginning and 115.1MB in the end (delta: -51.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-16 07:58:46,271 INFO L158 Benchmark]: TraceAbstraction took 10269.98ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 115.1MB in the beginning and 100.5MB in the end (delta: 14.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-11-16 07:58:46,271 INFO L158 Benchmark]: Witness Printer took 47.95ms. Allocated memory is still 186.6MB. Free memory was 100.5MB in the beginning and 97.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 07:58:46,273 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 148.9MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.61ms. Allocated memory is still 148.9MB. Free memory was 78.5MB in the beginning and 66.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.31ms. Allocated memory is still 148.9MB. Free memory was 66.2MB in the beginning and 64.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.96ms. Allocated memory is still 148.9MB. Free memory was 64.9MB in the beginning and 63.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 314.51ms. Allocated memory is still 148.9MB. Free memory was 63.3MB in the beginning and 115.1MB in the end (delta: -51.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10269.98ms. Allocated memory was 148.9MB in the beginning and 186.6MB in the end (delta: 37.7MB). Free memory was 115.1MB in the beginning and 100.5MB in the end (delta: 14.6MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * Witness Printer took 47.95ms. Allocated memory is still 186.6MB. Free memory was 100.5MB in the beginning and 97.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=5] [L39] int result = fibo1(x); [L40] COND TRUE result == 5 VAL [x=5] [L41] reach_error() VAL [x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 1856 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1587 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2242 IncrementalHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 269 mSDtfsCounter, 2242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1025 GetRequests, 831 SyntacticMatches, 24 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=8, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 116 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2382 SizeOfPredicates, 15 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 1550/1986 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-16 07:58:46,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE