./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD --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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:15:51,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:15:51,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:15:51,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:15:51,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:15:51,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:15:51,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:15:51,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:15:51,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:15:51,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:15:51,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:15:51,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:15:51,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:15:51,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:15:51,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:15:51,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:15:51,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:15:51,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:15:51,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:15:51,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:15:51,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:15:51,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:15:51,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:15:51,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:15:51,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:15:51,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:15:51,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:15:51,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:15:51,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:15:51,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:15:51,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:15:51,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:15:51,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:15:51,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:15:51,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:15:51,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:15:51,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:15:51,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:15:51,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:15:51,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:15:51,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:15:51,692 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 23:15:51,738 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:15:51,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:15:51,749 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:15:51,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:15:51,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:15:51,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:15:51,755 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:15:51,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:15:51,755 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:15:51,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:15:51,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:15:51,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:15:51,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:15:51,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:15:51,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:15:51,757 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:15:51,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:15:51,757 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:15:51,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:15:51,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:15:51,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:15:51,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:15:51,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:15:51,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:15:51,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:15:51,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:15:51,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:15:51,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:15:51,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:15:51,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:15:51,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:15:51,760 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:15:51,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/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_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD 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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2021-10-28 23:15:52,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:15:52,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:15:52,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:15:52,057 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:15:52,058 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:15:52,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-28 23:15:52,148 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/data/dff1d31c9/7d3bd7f2370f49ca9e6bb3521ee5a42e/FLAG3e46c1363 [2021-10-28 23:15:52,669 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:15:52,672 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-28 23:15:52,685 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/data/dff1d31c9/7d3bd7f2370f49ca9e6bb3521ee5a42e/FLAG3e46c1363 [2021-10-28 23:15:53,018 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/data/dff1d31c9/7d3bd7f2370f49ca9e6bb3521ee5a42e [2021-10-28 23:15:53,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:15:53,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:15:53,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:15:53,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:15:53,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:15:53,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340acba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53, skipping insertion in model container [2021-10-28 23:15:53,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:15:53,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:15:53,210 WARN L228 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_255e6514-d1e2-4531-a003-2ac55363c524/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-28 23:15:53,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:15:53,225 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:15:53,276 WARN L228 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_255e6514-d1e2-4531-a003-2ac55363c524/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-28 23:15:53,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:15:53,291 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:15:53,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53 WrapperNode [2021-10-28 23:15:53,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:15:53,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:15:53,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:15:53,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:15:53,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:15:53,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:15:53,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:15:53,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:15:53,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:15:53,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:15:53,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:15:53,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:15:53,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (1/1) ... [2021-10-28 23:15:53,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:15:53,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:15:53,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:15:53,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:15:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-10-28 23:15:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-10-28 23:15:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:15:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:15:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:15:53,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:15:53,721 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:15:53,724 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-28 23:15:53,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:15:53 BoogieIcfgContainer [2021-10-28 23:15:53,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:15:53,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:15:53,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:15:53,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:15:53,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:15:53" (1/3) ... [2021-10-28 23:15:53,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f74d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:15:53, skipping insertion in model container [2021-10-28 23:15:53,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:15:53" (2/3) ... [2021-10-28 23:15:53,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f74d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:15:53, skipping insertion in model container [2021-10-28 23:15:53,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:15:53" (3/3) ... [2021-10-28 23:15:53,738 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-10-28 23:15:53,744 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:15:53,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 23:15:53,810 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:15:53,825 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:15:53,825 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 23:15:53,848 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) [2021-10-28 23:15:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-28 23:15:53,854 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:15:53,855 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:15:53,857 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:15:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:15:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-10-28 23:15:53,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:15:53,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100782554] [2021-10-28 23:15:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:53,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:15:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:15:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:15:54,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:15:54,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100782554] [2021-10-28 23:15:54,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100782554] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:15:54,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:15:54,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:15:54,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489338762] [2021-10-28 23:15:54,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:15:54,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:15:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:15:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:15:54,139 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) [2021-10-28 23:15:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:15:54,229 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-10-28 23:15:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:15:54,231 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 [2021-10-28 23:15:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:15:54,240 INFO L225 Difference]: With dead ends: 31 [2021-10-28 23:15:54,240 INFO L226 Difference]: Without dead ends: 18 [2021-10-28 23:15:54,243 INFO L786 BasicCegarLoop]: 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 [2021-10-28 23:15:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-10-28 23:15:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-28 23:15:54,320 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) [2021-10-28 23:15:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-28 23:15:54,323 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-10-28 23:15:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:15:54,323 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-28 23:15:54,324 INFO L471 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) [2021-10-28 23:15:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-28 23:15:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-28 23:15:54,326 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:15:54,326 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:15:54,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:15:54,326 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:15:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:15:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-10-28 23:15:54,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:15:54,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829599754] [2021-10-28 23:15:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:54,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:15:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:15:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:15:54,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:15:54,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829599754] [2021-10-28 23:15:54,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829599754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:15:54,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:15:54,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:15:54,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459796660] [2021-10-28 23:15:54,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:15:54,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:15:54,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:15:54,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:15:54,475 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) [2021-10-28 23:15:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:15:54,533 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-10-28 23:15:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:15:54,534 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 [2021-10-28 23:15:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:15:54,535 INFO L225 Difference]: With dead ends: 24 [2021-10-28 23:15:54,536 INFO L226 Difference]: Without dead ends: 20 [2021-10-28 23:15:54,537 INFO L786 BasicCegarLoop]: 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 [2021-10-28 23:15:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-28 23:15:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-10-28 23:15:54,543 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) [2021-10-28 23:15:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-28 23:15:54,544 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-10-28 23:15:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:15:54,545 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-28 23:15:54,545 INFO L471 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) [2021-10-28 23:15:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-28 23:15:54,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-28 23:15:54,547 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:15:54,548 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:15:54,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:15:54,548 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:15:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:15:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-10-28 23:15:54,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:15:54,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032414667] [2021-10-28 23:15:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:54,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:15:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:15:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 23:15:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 23:15:54,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:15:54,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032414667] [2021-10-28 23:15:54,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032414667] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:54,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100192372] [2021-10-28 23:15:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:54,715 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:15:54,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:15:54,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 23:15:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:54,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-28 23:15:54,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:15:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 23:15:55,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100192372] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:55,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:15:55,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-10-28 23:15:55,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776618344] [2021-10-28 23:15:55,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:15:55,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:15:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:15:55,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:15:55,040 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-28 23:15:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:15:55,152 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-10-28 23:15:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:15:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23 [2021-10-28 23:15:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:15:55,157 INFO L225 Difference]: With dead ends: 35 [2021-10-28 23:15:55,157 INFO L226 Difference]: Without dead ends: 20 [2021-10-28 23:15:55,162 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:15:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-28 23:15:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-28 23:15:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-10-28 23:15:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-10-28 23:15:55,185 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-10-28 23:15:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:15:55,187 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-10-28 23:15:55,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-28 23:15:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-10-28 23:15:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-28 23:15:55,191 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:15:55,191 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:15:55,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 23:15:55,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:55,407 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:15:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:15:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash 187716987, now seen corresponding path program 1 times [2021-10-28 23:15:55,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:15:55,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821805298] [2021-10-28 23:15:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:55,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:15:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:15:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:55,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 23:15:55,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:15:55,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821805298] [2021-10-28 23:15:55,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821805298] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:55,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091468818] [2021-10-28 23:15:55,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:55,630 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:55,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:15:55,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:15:55,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 23:15:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:55,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-28 23:15:55,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:15:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 23:15:55,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091468818] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:55,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:15:55,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-10-28 23:15:55,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64112863] [2021-10-28 23:15:55,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:15:55,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:15:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:15:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:15:55,812 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-28 23:15:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:15:55,909 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-10-28 23:15:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:15:55,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-10-28 23:15:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:15:55,913 INFO L225 Difference]: With dead ends: 38 [2021-10-28 23:15:55,913 INFO L226 Difference]: Without dead ends: 34 [2021-10-28 23:15:55,914 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:15:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-10-28 23:15:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-10-28 23:15:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-10-28 23:15:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-10-28 23:15:55,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-10-28 23:15:55,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:15:55,925 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-10-28 23:15:55,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-28 23:15:55,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-10-28 23:15:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 23:15:55,928 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:15:55,928 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:15:55,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 23:15:56,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:56,147 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:15:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:15:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1151618030, now seen corresponding path program 2 times [2021-10-28 23:15:56,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:15:56,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913979597] [2021-10-28 23:15:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:56,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:15:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:15:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:56,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:56,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:15:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-28 23:15:56,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:15:56,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913979597] [2021-10-28 23:15:56,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913979597] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:56,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590873462] [2021-10-28 23:15:56,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-28 23:15:56,351 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:56,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:15:56,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:15:56,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 23:15:56,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-28 23:15:56,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 23:15:56,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-28 23:15:56,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:15:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-28 23:15:56,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590873462] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:56,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:15:56,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-10-28 23:15:56,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759051084] [2021-10-28 23:15:56,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 23:15:56,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:15:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 23:15:56,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:15:56,691 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-10-28 23:15:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:15:56,916 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2021-10-28 23:15:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 23:15:56,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 37 [2021-10-28 23:15:56,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:15:56,920 INFO L225 Difference]: With dead ends: 68 [2021-10-28 23:15:56,920 INFO L226 Difference]: Without dead ends: 35 [2021-10-28 23:15:56,922 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-10-28 23:15:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-28 23:15:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-28 23:15:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-10-28 23:15:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-10-28 23:15:56,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2021-10-28 23:15:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:15:56,937 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-10-28 23:15:56,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-10-28 23:15:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-10-28 23:15:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-28 23:15:56,944 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:15:56,944 INFO L513 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:15:56,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-10-28 23:15:57,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:57,163 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:15:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:15:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1916996739, now seen corresponding path program 3 times [2021-10-28 23:15:57,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:15:57,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805556912] [2021-10-28 23:15:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:57,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:15:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:15:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:15:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:15:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:15:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-28 23:15:57,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:15:57,514 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805556912] [2021-10-28 23:15:57,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805556912] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:57,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637654682] [2021-10-28 23:15:57,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-28 23:15:57,516 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:57,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:15:57,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:15:57,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-28 23:15:57,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-28 23:15:57,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 23:15:57,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-28 23:15:57,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:15:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-10-28 23:15:57,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637654682] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:57,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:15:57,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2021-10-28 23:15:57,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840842214] [2021-10-28 23:15:57,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 23:15:57,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:15:57,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 23:15:57,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:15:57,911 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-10-28 23:15:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:15:58,099 INFO L93 Difference]: Finished difference Result 93 states and 139 transitions. [2021-10-28 23:15:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 23:15:58,100 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 79 [2021-10-28 23:15:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:15:58,116 INFO L225 Difference]: With dead ends: 93 [2021-10-28 23:15:58,116 INFO L226 Difference]: Without dead ends: 87 [2021-10-28 23:15:58,120 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-10-28 23:15:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-28 23:15:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2021-10-28 23:15:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (43), 21 states have call predecessors, (43), 16 states have call successors, (43) [2021-10-28 23:15:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2021-10-28 23:15:58,161 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 79 [2021-10-28 23:15:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:15:58,163 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2021-10-28 23:15:58,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-10-28 23:15:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2021-10-28 23:15:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-28 23:15:58,177 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:15:58,178 INFO L513 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:15:58,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-28 23:15:58,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:58,383 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:15:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:15:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1766942948, now seen corresponding path program 4 times [2021-10-28 23:15:58,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:15:58,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680279399] [2021-10-28 23:15:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:15:58,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:15:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:15:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:15:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:15:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-28 23:15:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:15:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-28 23:15:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:15:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:15:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:15:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:59,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:15:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:15:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-28 23:15:59,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:15:59,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680279399] [2021-10-28 23:15:59,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680279399] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:59,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170583928] [2021-10-28 23:15:59,027 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-28 23:15:59,028 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:15:59,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:15:59,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:15:59,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-28 23:15:59,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-28 23:15:59,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 23:15:59,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-28 23:15:59,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:15:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-28 23:15:59,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170583928] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:15:59,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:15:59,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2021-10-28 23:15:59,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464368140] [2021-10-28 23:15:59,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-28 23:15:59,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:15:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 23:15:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-10-28 23:15:59,712 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-10-28 23:15:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:15:59,954 INFO L93 Difference]: Finished difference Result 205 states and 344 transitions. [2021-10-28 23:15:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 23:15:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) Word has length 174 [2021-10-28 23:15:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:15:59,965 INFO L225 Difference]: With dead ends: 205 [2021-10-28 23:15:59,965 INFO L226 Difference]: Without dead ends: 201 [2021-10-28 23:15:59,968 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-10-28 23:15:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-28 23:16:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2021-10-28 23:16:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 42 states have call successors, (42), 13 states have call predecessors, (42), 25 states have return successors, (137), 54 states have call predecessors, (137), 42 states have call successors, (137) [2021-10-28 23:16:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 323 transitions. [2021-10-28 23:16:00,018 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 323 transitions. Word has length 174 [2021-10-28 23:16:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:16:00,019 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 323 transitions. [2021-10-28 23:16:00,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-10-28 23:16:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 323 transitions. [2021-10-28 23:16:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-10-28 23:16:00,026 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:16:00,026 INFO L513 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:16:00,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-10-28 23:16:00,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-28 23:16:00,242 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:16:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:16:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -778425254, now seen corresponding path program 5 times [2021-10-28 23:16:00,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:16:00,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368332520] [2021-10-28 23:16:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:16:00,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:16:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:16:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-28 23:16:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-28 23:16:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-28 23:16:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:00,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-28 23:16:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-10-28 23:16:01,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:16:01,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368332520] [2021-10-28 23:16:01,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368332520] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:16:01,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815200804] [2021-10-28 23:16:01,077 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-28 23:16:01,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:16:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:16:01,079 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:16:01,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-28 23:16:01,402 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2021-10-28 23:16:01,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 23:16:01,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-28 23:16:01,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:16:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 801 proven. 327 refuted. 0 times theorem prover too weak. 3440 trivial. 0 not checked. [2021-10-28 23:16:02,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815200804] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:16:02,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:16:02,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2021-10-28 23:16:02,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595588606] [2021-10-28 23:16:02,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-28 23:16:02,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:16:02,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-28 23:16:02,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-10-28 23:16:02,169 INFO L87 Difference]: Start difference. First operand 189 states and 323 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-10-28 23:16:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:16:02,449 INFO L93 Difference]: Finished difference Result 297 states and 574 transitions. [2021-10-28 23:16:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 23:16:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) Word has length 283 [2021-10-28 23:16:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:16:02,453 INFO L225 Difference]: With dead ends: 297 [2021-10-28 23:16:02,453 INFO L226 Difference]: Without dead ends: 100 [2021-10-28 23:16:02,456 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2021-10-28 23:16:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-28 23:16:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2021-10-28 23:16:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (43), 15 states have call predecessors, (43), 13 states have call successors, (43) [2021-10-28 23:16:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 115 transitions. [2021-10-28 23:16:02,469 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 115 transitions. Word has length 283 [2021-10-28 23:16:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:16:02,470 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 115 transitions. [2021-10-28 23:16:02,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-10-28 23:16:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 115 transitions. [2021-10-28 23:16:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-10-28 23:16:02,483 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:16:02,484 INFO L513 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:16:02,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-28 23:16:02,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:16:02,699 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:16:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:16:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 6 times [2021-10-28 23:16:02,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:16:02,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534540547] [2021-10-28 23:16:02,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:16:02,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:16:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 23:16:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-28 23:16:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-28 23:16:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-28 23:16:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-28 23:16:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-28 23:16:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-28 23:16:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-28 23:16:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-28 23:16:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-28 23:16:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-28 23:16:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 23:16:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 23:16:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:16:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-10-28 23:16:04,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:16:04,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534540547] [2021-10-28 23:16:04,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534540547] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:16:04,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507456952] [2021-10-28 23:16:04,499 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-28 23:16:04,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:16:04,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:16:04,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 23:16:04,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-28 23:16:05,162 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2021-10-28 23:16:05,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-28 23:16:05,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-28 23:16:05,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:16:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2668 proven. 293 refuted. 0 times theorem prover too weak. 13446 trivial. 0 not checked. [2021-10-28 23:16:06,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507456952] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 23:16:06,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 23:16:06,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 30 [2021-10-28 23:16:06,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128681191] [2021-10-28 23:16:06,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-28 23:16:06,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:16:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-28 23:16:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2021-10-28 23:16:06,567 INFO L87 Difference]: Start difference. First operand 71 states and 115 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-10-28 23:16:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:16:07,459 INFO L93 Difference]: Finished difference Result 189 states and 398 transitions. [2021-10-28 23:16:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-28 23:16:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) Word has length 528 [2021-10-28 23:16:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:16:07,463 INFO L225 Difference]: With dead ends: 189 [2021-10-28 23:16:07,463 INFO L226 Difference]: Without dead ends: 121 [2021-10-28 23:16:07,466 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 686 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=649, Invalid=2543, Unknown=0, NotChecked=0, Total=3192 [2021-10-28 23:16:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-28 23:16:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2021-10-28 23:16:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.075) internal successors, (86), 75 states have internal predecessors, (86), 21 states have call successors, (21), 18 states have call predecessors, (21), 9 states have return successors, (46), 17 states have call predecessors, (46), 21 states have call successors, (46) [2021-10-28 23:16:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2021-10-28 23:16:07,481 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 528 [2021-10-28 23:16:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:16:07,483 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2021-10-28 23:16:07,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-10-28 23:16:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2021-10-28 23:16:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-10-28 23:16:07,492 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:16:07,493 INFO L513 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:16:07,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-28 23:16:07,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 23:16:07,722 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:16:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:16:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 7 times [2021-10-28 23:16:07,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:16:07,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704570784] [2021-10-28 23:16:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:16:07,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:16:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:16:07,827 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:16:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:16:08,093 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:16:08,093 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 23:16:08,094 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:16:08,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:16:08,100 INFO L731 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2021-10-28 23:16:08,105 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:16:08,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:16:08 BoogieIcfgContainer [2021-10-28 23:16:08,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:16:08,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:16:08,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:16:08,326 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:16:08,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:15:53" (3/4) ... [2021-10-28 23:16:08,329 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 23:16:08,454 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:16:08,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:16:08,456 INFO L168 Benchmark]: Toolchain (without parser) took 15432.17 ms. Allocated memory was 86.0 MB in the beginning and 188.7 MB in the end (delta: 102.8 MB). Free memory was 63.1 MB in the beginning and 102.2 MB in the end (delta: -39.1 MB). Peak memory consumption was 63.9 MB. Max. memory is 16.1 GB. [2021-10-28 23:16:08,456 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 86.0 MB. Free memory is still 60.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:16:08,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.48 ms. Allocated memory is still 86.0 MB. Free memory was 62.8 MB in the beginning and 62.9 MB in the end (delta: -83.6 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:16:08,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.06 ms. Allocated memory is still 86.0 MB. Free memory was 62.9 MB in the beginning and 61.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:16:08,457 INFO L168 Benchmark]: Boogie Preprocessor took 22.00 ms. Allocated memory is still 86.0 MB. Free memory was 61.6 MB in the beginning and 60.7 MB in the end (delta: 967.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:16:08,457 INFO L168 Benchmark]: RCFGBuilder took 373.49 ms. Allocated memory is still 86.0 MB. Free memory was 60.7 MB in the beginning and 51.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:16:08,458 INFO L168 Benchmark]: TraceAbstraction took 14596.86 ms. Allocated memory was 86.0 MB in the beginning and 188.7 MB in the end (delta: 102.8 MB). Free memory was 51.2 MB in the beginning and 122.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 94.7 MB. Max. memory is 16.1 GB. [2021-10-28 23:16:08,458 INFO L168 Benchmark]: Witness Printer took 128.09 ms. Allocated memory is still 188.7 MB. Free memory was 122.1 MB in the beginning and 102.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:16:08,460 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 86.0 MB. Free memory is still 60.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 268.48 ms. Allocated memory is still 86.0 MB. Free memory was 62.8 MB in the beginning and 62.9 MB in the end (delta: -83.6 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.06 ms. Allocated memory is still 86.0 MB. Free memory was 62.9 MB in the beginning and 61.6 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.00 ms. Allocated memory is still 86.0 MB. Free memory was 61.6 MB in the beginning and 60.7 MB in the end (delta: 967.2 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 373.49 ms. Allocated memory is still 86.0 MB. Free memory was 60.7 MB in the beginning and 51.6 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14596.86 ms. Allocated memory was 86.0 MB in the beginning and 188.7 MB in the end (delta: 102.8 MB). Free memory was 51.2 MB in the beginning and 122.1 MB in the end (delta: -70.9 MB). Peak memory consumption was 94.7 MB. Max. memory is 16.1 GB. * Witness Printer took 128.09 ms. Allocated memory is still 188.7 MB. Free memory was 122.1 MB in the beginning and 102.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 10, TraceHistogramMax: 77, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 155 SDtfs, 571 SDslu, 509 SDs, 0 SdLazy, 1296 SolverSat, 734 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1480 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=7, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2777 NumberOfCodeBlocks, 2691 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3541 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 40160/45994 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! [2021-10-28 23:16:08,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255e6514-d1e2-4531-a003-2ac55363c524/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...