./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.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/Fibonacci05.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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:56:21,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:56:21,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:56:21,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:56:21,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:56:21,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:56:21,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:56:21,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:56:21,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:56:21,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:56:21,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:56:21,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:56:21,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:56:21,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:56:21,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:56:21,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:56:21,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:56:21,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:56:21,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:56:21,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:56:21,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:56:21,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:56:21,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:56:21,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:56:21,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:56:21,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:56:21,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:56:21,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:56:21,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:56:21,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:56:21,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:56:21,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:56:21,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:56:21,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:56:21,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:56:21,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:56:21,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:56:21,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:56:21,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:56:21,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:56:21,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:56:21,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:56:21,343 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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2024-11-16 07:56:21,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:56:21,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:56:21,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:56:21,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:56:21,599 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:56:21,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2024-11-16 07:56:22,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:56:23,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:56:23,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2024-11-16 07:56:23,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bccb9270/768ffdba63e34fa881967010759dc9e8/FLAGa4e068cd7 [2024-11-16 07:56:23,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bccb9270/768ffdba63e34fa881967010759dc9e8 [2024-11-16 07:56:23,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:56:23,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:56:23,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:56:23,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:56:23,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:56:23,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508a854c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23, skipping insertion in model container [2024-11-16 07:56:23,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:56:23,275 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/Fibonacci05.c[746,759] [2024-11-16 07:56:23,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:56:23,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:56:23,298 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/Fibonacci05.c[746,759] [2024-11-16 07:56:23,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:56:23,311 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:56:23,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23 WrapperNode [2024-11-16 07:56:23,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:56:23,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:56:23,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:56:23,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:56:23,319 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:56:23" (1/1) ... [2024-11-16 07:56:23,324 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:56:23" (1/1) ... [2024-11-16 07:56:23,336 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-11-16 07:56:23,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:56:23,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:56:23,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:56:23,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:56:23,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,357 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:56:23,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:56:23,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:56:23,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:56:23,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:56:23,363 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (1/1) ... [2024-11-16 07:56:23,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:56:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:23,393 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:56:23,396 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:56:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-11-16 07:56:23,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-11-16 07:56:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:56:23,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:56:23,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:56:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:56:23,506 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:56:23,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:56:23,593 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2024-11-16 07:56:23,631 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 07:56:23,632 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:56:23,641 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:56:23,641 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:56:23,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:56:23 BoogieIcfgContainer [2024-11-16 07:56:23,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:56:23,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:56:23,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:56:23,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:56:23,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:56:23" (1/3) ... [2024-11-16 07:56:23,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2785d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:56:23, skipping insertion in model container [2024-11-16 07:56:23,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:56:23" (2/3) ... [2024-11-16 07:56:23,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2785d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:56:23, skipping insertion in model container [2024-11-16 07:56:23,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:56:23" (3/3) ... [2024-11-16 07:56:23,649 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2024-11-16 07:56:23,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:56:23,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:56:23,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:56:23,714 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;@626b97b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:56:23,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:56:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 07:56:23,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 07:56:23,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:23,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:23,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:23,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash -830993916, now seen corresponding path program 1 times [2024-11-16 07:56:23,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494952127] [2024-11-16 07:56:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:23,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:23,977 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:56:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:23,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494952127] [2024-11-16 07:56:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494952127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:23,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:23,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:56:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828461809] [2024-11-16 07:56:23,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:23,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:56:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:56:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:56:24,013 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:56:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:24,089 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-16 07:56:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:56:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-16 07:56:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:24,097 INFO L225 Difference]: With dead ends: 33 [2024-11-16 07:56:24,098 INFO L226 Difference]: Without dead ends: 21 [2024-11-16 07:56:24,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:56:24,102 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:24,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:56:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-16 07:56:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-16 07:56:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 07:56:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-16 07:56:24,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-11-16 07:56:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:24,130 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-16 07:56:24,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:56:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-16 07:56:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 07:56:24,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:24,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:24,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:56:24,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:24,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1134286775, now seen corresponding path program 1 times [2024-11-16 07:56:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:24,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360457086] [2024-11-16 07:56:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:24,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:24,239 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:56:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360457086] [2024-11-16 07:56:24,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360457086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:56:24,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:56:24,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:56:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026450388] [2024-11-16 07:56:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:56:24,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:56:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:24,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:56:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:56:24,242 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:56:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:24,289 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-16 07:56:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:56:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:56:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:24,291 INFO L225 Difference]: With dead ends: 26 [2024-11-16 07:56:24,291 INFO L226 Difference]: Without dead ends: 21 [2024-11-16 07:56:24,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:56:24,293 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:24,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:56:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-16 07:56:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-16 07:56:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 07:56:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-16 07:56:24,299 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2024-11-16 07:56:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:24,300 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-16 07:56:24,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:56:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-16 07:56:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 07:56:24,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:24,301 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:24,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:56:24,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:24,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1490281339, now seen corresponding path program 1 times [2024-11-16 07:56:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:24,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490842624] [2024-11-16 07:56:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:24,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:24,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 07:56:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:56:24,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490842624] [2024-11-16 07:56:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490842624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181255851] [2024-11-16 07:56:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:24,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:24,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:24,456 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:56:24,457 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:56:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:24,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:56:24,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 07:56:24,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 07:56:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181255851] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:24,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:24,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2024-11-16 07:56:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235991121] [2024-11-16 07:56:24,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:24,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:56:24,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:56:24,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:56:24,753 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-16 07:56:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:24,928 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2024-11-16 07:56:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 07:56:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2024-11-16 07:56:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:24,929 INFO L225 Difference]: With dead ends: 48 [2024-11-16 07:56:24,929 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 07:56:24,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-16 07:56:24,930 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:24,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 65 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:56:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 07:56:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-16 07:56:24,940 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, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-16 07:56:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2024-11-16 07:56:24,942 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 24 [2024-11-16 07:56:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:24,942 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2024-11-16 07:56:24,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-16 07:56:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2024-11-16 07:56:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 07:56:24,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:24,944 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:24,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 07:56:25,145 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:56:25,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash 724155635, now seen corresponding path program 1 times [2024-11-16 07:56:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980937318] [2024-11-16 07:56:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:25,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-16 07:56:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980937318] [2024-11-16 07:56:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980937318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:25,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824128366] [2024-11-16 07:56:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:25,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:25,514 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:56:25,515 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:56:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:25,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:56:25,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-16 07:56:25,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-16 07:56:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824128366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:26,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:26,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2024-11-16 07:56:26,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641981801] [2024-11-16 07:56:26,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:26,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 07:56:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 07:56:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-16 07:56:26,023 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-16 07:56:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:26,222 INFO L93 Difference]: Finished difference Result 75 states and 125 transitions. [2024-11-16 07:56:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 07:56:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 66 [2024-11-16 07:56:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:26,225 INFO L225 Difference]: With dead ends: 75 [2024-11-16 07:56:26,225 INFO L226 Difference]: Without dead ends: 46 [2024-11-16 07:56:26,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2024-11-16 07:56:26,226 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:26,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:56:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-16 07:56:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-11-16 07:56:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (25), 9 states have call predecessors, (25), 7 states have call successors, (25) [2024-11-16 07:56:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2024-11-16 07:56:26,234 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 66 [2024-11-16 07:56:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:26,234 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2024-11-16 07:56:26,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-16 07:56:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2024-11-16 07:56:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 07:56:26,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:26,239 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:26,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 07:56:26,439 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:56:26,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:26,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash 736186607, now seen corresponding path program 2 times [2024-11-16 07:56:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760832692] [2024-11-16 07:56:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:56:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 07:56:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:56:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:56:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2024-11-16 07:56:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:26,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760832692] [2024-11-16 07:56:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760832692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537622836] [2024-11-16 07:56:26,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 07:56:26,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:26,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:26,928 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:56:26,931 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:56:27,003 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 07:56:27,004 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:56:27,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 07:56:27,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2024-11-16 07:56:27,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2024-11-16 07:56:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537622836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:28,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2024-11-16 07:56:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665180399] [2024-11-16 07:56:28,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:28,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 07:56:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:28,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 07:56:28,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2024-11-16 07:56:28,026 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-16 07:56:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:28,432 INFO L93 Difference]: Finished difference Result 119 states and 234 transitions. [2024-11-16 07:56:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 07:56:28,432 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 172 [2024-11-16 07:56:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:28,435 INFO L225 Difference]: With dead ends: 119 [2024-11-16 07:56:28,435 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 07:56:28,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 386 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2024-11-16 07:56:28,438 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 81 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:28,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 135 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:56:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 07:56:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2024-11-16 07:56:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2024-11-16 07:56:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 106 transitions. [2024-11-16 07:56:28,468 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 106 transitions. Word has length 172 [2024-11-16 07:56:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:28,468 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 106 transitions. [2024-11-16 07:56:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-16 07:56:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 106 transitions. [2024-11-16 07:56:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-16 07:56:28,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:28,474 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:28,488 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:56:28,674 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:56:28,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1640261389, now seen corresponding path program 3 times [2024-11-16 07:56:28,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:28,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646813540] [2024-11-16 07:56:28,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:28,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:56:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:56:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 07:56:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:56:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:56:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2024-11-16 07:56:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646813540] [2024-11-16 07:56:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646813540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321675066] [2024-11-16 07:56:30,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 07:56:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:30,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:30,107 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:56:30,109 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:56:30,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2024-11-16 07:56:30,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:56:30,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 07:56:30,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2024-11-16 07:56:30,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2024-11-16 07:56:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321675066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:32,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2024-11-16 07:56:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434581644] [2024-11-16 07:56:32,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:32,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-16 07:56:32,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:32,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-16 07:56:32,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 07:56:32,122 INFO L87 Difference]: Start difference. First operand 67 states and 106 transitions. Second operand has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2024-11-16 07:56:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:32,507 INFO L93 Difference]: Finished difference Result 174 states and 341 transitions. [2024-11-16 07:56:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 07:56:32,508 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 352 [2024-11-16 07:56:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:32,510 INFO L225 Difference]: With dead ends: 174 [2024-11-16 07:56:32,510 INFO L226 Difference]: Without dead ends: 110 [2024-11-16 07:56:32,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 789 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2024-11-16 07:56:32,512 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 122 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:32,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 171 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:56:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-16 07:56:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-11-16 07:56:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 63 states have internal predecessors, (72), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2024-11-16 07:56:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-11-16 07:56:32,522 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 352 [2024-11-16 07:56:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:32,523 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-11-16 07:56:32,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 33 states have internal predecessors, (84), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2024-11-16 07:56:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-11-16 07:56:32,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-11-16 07:56:32,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:32,535 INFO L215 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:32,550 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:56:32,735 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:56:32,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:32,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -865748872, now seen corresponding path program 4 times [2024-11-16 07:56:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:32,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260794663] [2024-11-16 07:56:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:56:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:56:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:56:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 07:56:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:56:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-16 07:56:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:56:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:56:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 07:56:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 07:56:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:56:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-16 07:56:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 07:56:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:56:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2024-11-16 07:56:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:56:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260794663] [2024-11-16 07:56:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260794663] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:56:34,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392888986] [2024-11-16 07:56:34,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-16 07:56:34,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:56:34,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:56:34,497 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:56:34,498 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:56:34,640 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-16 07:56:34,640 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 07:56:34,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-16 07:56:34,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:56:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2024-11-16 07:56:34,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:56:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2024-11-16 07:56:38,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392888986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:56:38,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:56:38,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2024-11-16 07:56:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893201070] [2024-11-16 07:56:38,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:56:38,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-16 07:56:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:56:38,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-16 07:56:38,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2024-11-16 07:56:38,476 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 45 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 45 states have internal predecessors, (122), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2024-11-16 07:56:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:56:38,998 INFO L93 Difference]: Finished difference Result 219 states and 400 transitions. [2024-11-16 07:56:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-16 07:56:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 45 states have internal predecessors, (122), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) Word has length 529 [2024-11-16 07:56:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:56:39,002 INFO L225 Difference]: With dead ends: 219 [2024-11-16 07:56:39,002 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 07:56:39,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1271 GetRequests, 1186 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2024-11-16 07:56:39,005 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 245 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:56:39,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 241 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:56:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 07:56:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2024-11-16 07:56:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 76 states have internal predecessors, (82), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2024-11-16 07:56:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2024-11-16 07:56:39,017 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 529 [2024-11-16 07:56:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:56:39,018 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2024-11-16 07:56:39,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 45 states have internal predecessors, (122), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2024-11-16 07:56:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2024-11-16 07:56:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-16 07:56:39,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:56:39,023 INFO L215 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:56:39,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 07:56:39,223 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:56:39,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:56:39,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:56:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash 559897118, now seen corresponding path program 5 times [2024-11-16 07:56:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:56:39,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292994656] [2024-11-16 07:56:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:56:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:56:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:56:39,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:56:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:56:39,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:56:39,354 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:56:39,355 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:56:39,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:56:39,360 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2024-11-16 07:56:39,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:56:39,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:56:39 BoogieIcfgContainer [2024-11-16 07:56:39,450 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:56:39,451 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:56:39,451 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:56:39,451 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:56:39,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:56:23" (3/4) ... [2024-11-16 07:56:39,452 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:56:39,527 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:56:39,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:56:39,528 INFO L158 Benchmark]: Toolchain (without parser) took 16409.10ms. Allocated memory was 148.9MB in the beginning and 392.2MB in the end (delta: 243.3MB). Free memory was 117.1MB in the beginning and 156.8MB in the end (delta: -39.7MB). Peak memory consumption was 204.5MB. Max. memory is 16.1GB. [2024-11-16 07:56:39,528 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:56:39,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.84ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 105.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 07:56:39,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.02ms. Allocated memory is still 148.9MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:56:39,528 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 102.5MB in the end (delta: 985.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:56:39,529 INFO L158 Benchmark]: IcfgBuilder took 279.92ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 117.5MB in the end (delta: -15.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 07:56:39,529 INFO L158 Benchmark]: TraceAbstraction took 15806.72ms. Allocated memory was 148.9MB in the beginning and 392.2MB in the end (delta: 243.3MB). Free memory was 116.5MB in the beginning and 165.3MB in the end (delta: -48.8MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. [2024-11-16 07:56:39,529 INFO L158 Benchmark]: Witness Printer took 76.56ms. Allocated memory is still 392.2MB. Free memory was 165.3MB in the beginning and 156.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 07:56:39,530 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.16ms. Allocated memory is still 102.8MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.84ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 105.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.02ms. Allocated memory is still 148.9MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 102.5MB in the end (delta: 985.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 279.92ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 117.5MB in the end (delta: -15.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15806.72ms. Allocated memory was 148.9MB in the beginning and 392.2MB in the end (delta: 243.3MB). Free memory was 116.5MB in the beginning and 165.3MB in the end (delta: -48.8MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. * Witness Printer took 76.56ms. Allocated memory is still 392.2MB. Free memory was 165.3MB in the beginning and 156.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 533 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 659 mSDsCounter, 602 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1403 IncrementalHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 602 mSolverCounterUnsat, 146 mSDtfsCounter, 1403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2792 GetRequests, 2557 SyntacticMatches, 30 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3411 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 55 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 2770 NumberOfCodeBlocks, 2593 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3435 ConstructedInterpolants, 0 QuantifiedInterpolants, 5471 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2159 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 60175/75984 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:56:39,559 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