./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:34:57,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:34:57,597 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:34:57,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:34:57,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:34:57,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:34:57,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:34:57,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:34:57,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:34:57,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:34:57,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:34:57,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:34:57,637 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:34:57,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:34:57,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:34:57,639 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:34:57,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:34:57,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:34:57,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:34:57,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:34:57,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:34:57,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:34:57,642 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:34:57,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:34:57,643 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:34:57,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:34:57,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:34:57,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:34:57,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:34:57,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:34:57,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:34:57,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:34:57,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:34:57,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:34:57,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:34:57,648 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:34:57,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:34:57,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:34:57,649 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:34:57,650 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2023-11-06 22:34:57,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:34:57,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:34:57,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:34:57,914 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:34:57,915 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:34:57,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/recursive/Fibonacci04.c [2023-11-06 22:35:01,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:01,311 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:01,312 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/sv-benchmarks/c/recursive/Fibonacci04.c [2023-11-06 22:35:01,320 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/data/ab0eb288c/3a6d13c1596f459193f50dcb5b40f764/FLAG962227fad [2023-11-06 22:35:01,344 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/data/ab0eb288c/3a6d13c1596f459193f50dcb5b40f764 [2023-11-06 22:35:01,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:01,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:01,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:01,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:01,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:01,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0e6a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01, skipping insertion in model container [2023-11-06 22:35:01,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,386 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:01,534 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2023-11-06 22:35:01,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:01,547 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:01,560 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2023-11-06 22:35:01,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:01,573 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:01,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01 WrapperNode [2023-11-06 22:35:01,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:01,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:01,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:01,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:01,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,604 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-11-06 22:35:01,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:01,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:01,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:01,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:01,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:01,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:01,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:01,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:01,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (1/1) ... [2023-11-06 22:35:01,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:01,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:35:01,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:35:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-11-06 22:35:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-11-06 22:35:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:35:01,767 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:01,769 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:01,897 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:01,903 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:01,903 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:35:01,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:01 BoogieIcfgContainer [2023-11-06 22:35:01,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:01,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:01,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:01,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:01,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:01" (1/3) ... [2023-11-06 22:35:01,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba88906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:01, skipping insertion in model container [2023-11-06 22:35:01,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:01" (2/3) ... [2023-11-06 22:35:01,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba88906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:01, skipping insertion in model container [2023-11-06 22:35:01,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:01" (3/3) ... [2023-11-06 22:35:01,916 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2023-11-06 22:35:01,936 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:01,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:01,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:01,991 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5c52ec43, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:01,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-06 22:35:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:35:02,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:02,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:02,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:02,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2023-11-06 22:35:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903793227] [2023-11-06 22:35:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:35:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903793227] [2023-11-06 22:35:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903793227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265265067] [2023-11-06 22:35:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:02,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:02,405 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:35:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:02,499 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-11-06 22:35:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:02,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-06 22:35:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:02,532 INFO L225 Difference]: With dead ends: 29 [2023-11-06 22:35:02,532 INFO L226 Difference]: Without dead ends: 18 [2023-11-06 22:35:02,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:02,540 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:02,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-06 22:35:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-06 22:35:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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) [2023-11-06 22:35:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-06 22:35:02,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-11-06 22:35:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:02,591 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-06 22:35:02,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:35:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-06 22:35:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:35:02,593 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:02,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:02,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:35:02,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:02,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2023-11-06 22:35:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843954122] [2023-11-06 22:35:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:35:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843954122] [2023-11-06 22:35:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843954122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540546329] [2023-11-06 22:35:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:02,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:02,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:02,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:02,742 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:35:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:02,794 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-11-06 22:35:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:02,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-06 22:35:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:02,796 INFO L225 Difference]: With dead ends: 24 [2023-11-06 22:35:02,797 INFO L226 Difference]: Without dead ends: 20 [2023-11-06 22:35:02,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:02,799 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:02,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-06 22:35:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-11-06 22:35:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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) [2023-11-06 22:35:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-06 22:35:02,808 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-11-06 22:35:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:02,808 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-06 22:35:02,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:35:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-06 22:35:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-06 22:35:02,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:02,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:02,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:35:02,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:02,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2023-11-06 22:35:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239133394] [2023-11-06 22:35:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:35:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:35:03,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239133394] [2023-11-06 22:35:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239133394] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:35:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346446699] [2023-11-06 22:35:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:03,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:03,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:35:03,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:35:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:03,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:35:03,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:35:03,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:35:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:35:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346446699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:35:03,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:35:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-11-06 22:35:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801336841] [2023-11-06 22:35:03,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:35:03,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:35:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:35:03,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:35:03,601 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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) [2023-11-06 22:35:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:03,840 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-11-06 22:35:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:35:03,840 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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 23 [2023-11-06 22:35:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:03,842 INFO L225 Difference]: With dead ends: 46 [2023-11-06 22:35:03,843 INFO L226 Difference]: Without dead ends: 29 [2023-11-06 22:35:03,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:35:03,846 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:03,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 64 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:35:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-06 22:35:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-06 22:35:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 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) [2023-11-06 22:35:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-11-06 22:35:03,858 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2023-11-06 22:35:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:03,859 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-11-06 22:35:03,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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) [2023-11-06 22:35:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-11-06 22:35:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:35:03,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:03,863 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:03,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:35:04,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:04,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:04,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:04,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2023-11-06 22:35:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289573569] [2023-11-06 22:35:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-06 22:35:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289573569] [2023-11-06 22:35:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289573569] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:35:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216423909] [2023-11-06 22:35:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:04,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:04,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:35:04,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:35:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:35:04,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-11-06 22:35:04,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:35:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-06 22:35:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216423909] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:35:05,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:35:05,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-11-06 22:35:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674710582] [2023-11-06 22:35:05,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:35:05,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 22:35:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:05,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 22:35:05,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:35:05,348 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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) [2023-11-06 22:35:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:05,569 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2023-11-06 22:35:05,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:35:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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 65 [2023-11-06 22:35:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:05,573 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:35:05,574 INFO L226 Difference]: Without dead ends: 44 [2023-11-06 22:35:05,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:35:05,576 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:05,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 87 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:35:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-06 22:35:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-06 22:35:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (19), 9 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-06 22:35:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-11-06 22:35:05,589 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2023-11-06 22:35:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:05,590 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-11-06 22:35:05,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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) [2023-11-06 22:35:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2023-11-06 22:35:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-06 22:35:05,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:05,596 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 14, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:05,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:05,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:05,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:05,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash -878098806, now seen corresponding path program 2 times [2023-11-06 22:35:05,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486206758] [2023-11-06 22:35:05,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:05,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:35:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:35:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-06 22:35:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:35:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 100 proven. 219 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2023-11-06 22:35:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486206758] [2023-11-06 22:35:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486206758] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:35:06,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858550063] [2023-11-06 22:35:06,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:35:06,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:06,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:35:06,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:35:06,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:35:06,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:35:06,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:35:06,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 263 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2023-11-06 22:35:06,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:35:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 275 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2023-11-06 22:35:07,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858550063] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:35:07,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:35:07,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2023-11-06 22:35:07,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5837092] [2023-11-06 22:35:07,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:35:07,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:35:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:35:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:35:07,550 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-06 22:35:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:07,787 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2023-11-06 22:35:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:35:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 144 [2023-11-06 22:35:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:07,794 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:35:07,794 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 22:35:07,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 319 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:35:07,801 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:07,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 114 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:35:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 22:35:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2023-11-06 22:35:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2023-11-06 22:35:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-11-06 22:35:07,830 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 144 [2023-11-06 22:35:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:07,831 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-11-06 22:35:07,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-06 22:35:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2023-11-06 22:35:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-06 22:35:07,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:07,839 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:07,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:08,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:08,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:08,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 3 times [2023-11-06 22:35:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081327370] [2023-11-06 22:35:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:35:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:35:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:35:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:35:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 22:35:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-06 22:35:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2023-11-06 22:35:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081327370] [2023-11-06 22:35:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081327370] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:35:08,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923740632] [2023-11-06 22:35:08,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:35:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:08,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:35:08,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:35:08,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-11-06 22:35:08,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:35:08,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:35:08,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2023-11-06 22:35:08,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:35:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 34 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2023-11-06 22:35:09,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923740632] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:35:09,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:35:09,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 18 [2023-11-06 22:35:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192434364] [2023-11-06 22:35:09,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:35:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 22:35:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 22:35:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:35:09,527 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-11-06 22:35:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:09,752 INFO L93 Difference]: Finished difference Result 101 states and 160 transitions. [2023-11-06 22:35:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:35:09,753 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) Word has length 147 [2023-11-06 22:35:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:09,755 INFO L225 Difference]: With dead ends: 101 [2023-11-06 22:35:09,755 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 22:35:09,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 326 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:35:09,757 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:09,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 127 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:35:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 22:35:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-06 22:35:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 33 states have internal predecessors, (37), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2023-11-06 22:35:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-11-06 22:35:09,766 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 147 [2023-11-06 22:35:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:09,767 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-11-06 22:35:09,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-11-06 22:35:09,768 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-11-06 22:35:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-06 22:35:09,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:09,770 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:09,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:35:09,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:09,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 4 times [2023-11-06 22:35:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:09,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022504944] [2023-11-06 22:35:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:09,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:09,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:35:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:10,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:35:10,033 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:35:10,034 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:35:10,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:35:10,039 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-11-06 22:35:10,044 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:35:10,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:35:10 BoogieIcfgContainer [2023-11-06 22:35:10,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:35:10,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:35:10,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:35:10,107 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:35:10,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:01" (3/4) ... [2023-11-06 22:35:10,109 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:35:10,175 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:35:10,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:35:10,176 INFO L158 Benchmark]: Toolchain (without parser) took 8826.86ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 130.4MB in the beginning and 77.6MB in the end (delta: 52.8MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2023-11-06 22:35:10,176 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 68.1MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:10,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.68ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 120.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:35:10,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.25ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 118.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:10,177 INFO L158 Benchmark]: Boogie Preprocessor took 19.87ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 117.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:10,177 INFO L158 Benchmark]: RCFGBuilder took 280.09ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 107.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:35:10,178 INFO L158 Benchmark]: TraceAbstraction took 8197.62ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 106.9MB in the beginning and 80.8MB in the end (delta: 26.1MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2023-11-06 22:35:10,178 INFO L158 Benchmark]: Witness Printer took 68.28ms. Allocated memory is still 211.8MB. Free memory was 79.7MB in the beginning and 77.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:10,181 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.61ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 68.1MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.68ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 120.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.25ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 118.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.87ms. Allocated memory is still 176.2MB. Free memory was 118.9MB in the beginning and 117.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 280.09ms. Allocated memory is still 176.2MB. Free memory was 117.9MB in the beginning and 107.9MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8197.62ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 106.9MB in the beginning and 80.8MB in the end (delta: 26.1MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. * Witness Printer took 68.28ms. Allocated memory is still 211.8MB. Free memory was 79.7MB in the beginning and 77.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 465 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 682 IncrementalHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 104 mSDtfsCounter, 682 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 941 GetRequests, 838 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, InterpolantAutomatonStates: 66, 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, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 885 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1854 SizeOfPredicates, 12 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 6248/7404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:35:10,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31524306-2e56-4d34-863c-70f5ce78a2a1/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE